Format integers Sergey Svistunov

Compute a checksum over the decimal representations of binary integers as fast as possible.

Input: 250 000 000 uint32 values in little-endian binary on STDIN (4 bytes each).

Output: A uint64 checksum computed as:

CRC = sum of number_crc(n) for each n

where number_crc(n) converts n to its decimal string and sums ascii(digit) * position over each digit (0-indexed from the left).

Example: For n = 42, the decimal string is "42", so number_crc(42) = ascii('4') * 0 + ascii('2') * 1 = 52 * 0 + 50 * 1 = 50.

Back to listNov 12, 2025 07:53izotoffizotoffScore: 251,708Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 12, 2025 07:53251,5541,258,559,4851,230,616,0001,999,0002,412,544
2Nov 12, 2025 07:53251,5931,255,644,5011,230,809,0001,999,0002,326,528
3Nov 12, 2025 07:53251,6351,257,377,2661,230,015,0002,997,0002,326,528
4Nov 12, 2025 07:53251,6951,260,044,0821,231,307,0001,998,0002,322,432
5Nov 12, 2025 07:53251,7081,259,030,2131,230,369,0002,998,0002,330,624
6Nov 12, 2025 07:53251,7271,262,807,9111,231,464,0001,999,0002,326,528
7Nov 12, 2025 07:53251,7591,263,642,4811,230,618,0002,999,0002,322,432
8Nov 12, 2025 07:53251,7651,260,647,7811,227,649,0005,998,0002,408,448
9Nov 12, 2025 07:53251,8341,263,943,4171,227,994,0005,995,0002,326,528