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 listSep 23, 2026 19:47Matthias GörgensMatthias GörgensScore: 108,017Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 23, 2026 19:47106,544532,497,233520,950,0001,119,0002,113,536
2Sep 23, 2026 19:47106,861534,171,824522,482,0001,140,0002,113,536
3Sep 23, 2026 19:47107,351536,516,106524,888,0001,136,0002,113,536
4Sep 23, 2026 19:47107,514537,240,188525,695,0001,128,0002,113,536
5Sep 23, 2026 19:47108,017540,174,551528,142,0001,142,0002,113,536
6Sep 23, 2026 19:47108,698543,079,707531,490,0001,133,0002,113,536
7Sep 23, 2026 19:47108,705543,113,683531,515,0001,141,0002,113,536
8Sep 23, 2026 19:47110,444552,419,202540,041,0001,139,0002,113,536
9Sep 23, 2026 19:47110,532551,987,532540,479,0001,131,0002,113,536