Shortened Leaderboard Scores

Funny script to automatically shorten large leaderboard scores to compact forms like/similar to '1.8B' or '700k' for easier reading. Ideal for optimizing/making leaderboard viewing better.

اعتبارا من 14-06-2024. شاهد أحدث إصدار.

You will need to install an extension such as Tampermonkey, Greasemonkey or Violentmonkey to install this script.

You will need to install an extension such as Tampermonkey to install this script.

You will need to install an extension such as Tampermonkey or Violentmonkey to install this script.

You will need to install an extension such as Tampermonkey or Userscripts to install this script.

You will need to install an extension such as Tampermonkey to install this script.

You will need to install a user script manager extension to install this script.

(I already have a user script manager, let me install it!)

You will need to install an extension such as Stylus to install this style.

You will need to install an extension such as Stylus to install this style.

ستحتاج إلى تثبيت إضافة مثل Stylus لتثبيت هذا النمط.

ستحتاج إلى تثبيت إضافة لإدارة أنماط المستخدم لتتمكن من تثبيت هذا النمط.

ستحتاج إلى تثبيت إضافة لإدارة أنماط المستخدم لتثبيت هذا النمط.

ستحتاج إلى تثبيت إضافة لإدارة أنماط المستخدم لتثبيت هذا النمط.

(لدي بالفعل مثبت أنماط للمستخدم، دعني أقم بتثبيته!)

// ==UserScript==
// @name         Shortened Leaderboard Scores
// @namespace    lore
// @version      1
// @license      MIT
// @description  Funny script to automatically shorten large leaderboard scores to compact forms like/similar to '1.8B' or '700k' for easier reading. Ideal for optimizing/making leaderboard viewing better.
// @author       lore
// @match        *://*sploop.io/*
// @grant        none
// ==/UserScript==

(function() {
  'use strict';

  function shortenNumber(number) {
    if (number >= 1000 && number < 1000000) {
      return (number / 1000).toFixed(1).replace(/\.0$/, '') + 'k';
    } else if (number >= 1000000 && number < 1000000000) {
      return (number / 1000000).toFixed(1).replace(/\.0$/, '') + 'M';
    } else if (number >= 1000000000) {
      return (number / 1000000000).toFixed(1).replace(/\.0$/, '') + 'B';
    } else {
      return number;
    }
  }

  function updateScores() {
    updateLeaderboard('ranking-ranks-container');
    updateLeaderboard('ranking-rank-container');
    updateLeaderboard('ranks-container');

    updateSingleScore('total-score');
    updateSingleScore('score-left-value');
  }

  function updateLeaderboard(containerId) {
    const scores = document.querySelectorAll(`#${containerId} .ranking-score`);
    scores.forEach(updateScoreElement);
  }

  function updateSingleScore(elementId) {
    const scoreElement = document.getElementById(elementId);
    if (scoreElement) {
      updateScoreElement(scoreElement);
    }
  }

  function updateScoreElement(scoreElement) {
    const scoreText = scoreElement.textContent.trim();
    if (!scoreElement.dataset.shortened && !isNaN(scoreText)) {
      const score = parseInt(scoreText, 10);
      if (score >= 1000) {
        scoreElement.textContent = shortenNumber(score);
        scoreElement.dataset.shortened = true;
      }
    }
  }

  function isElementVisible(el) {
    const rect = el.getBoundingClientRect();
    return rect.top >= 0 && rect.bottom <= (window.innerHeight || document.documentElement.clientHeight);
  }

  setInterval(() => {
    if (isElementVisible(document.body)) {
      updateScores();
    }
  }, 30);
})();