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 listJul 27, 2026 12:08Kevin HeaveyKevin HeaveyScore: 59,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 12:1958,992299,077,156281,310,0007,753,00020,480
2Jul 27, 2026 12:1959,416301,151,876281,206,0009,937,00020,480
3Jul 27, 2026 12:1959,507307,398,678282,358,0009,230,0002,113,536
4Jul 27, 2026 12:1959,542301,833,712281,570,00010,190,00020,480
5Jul 27, 2026 12:1959,642302,203,939281,996,00010,253,0002,113,536
6Jul 27, 2026 12:1959,671303,127,851282,570,0009,819,00020,480
7Jul 27, 2026 12:1959,680304,559,231281,503,00010,930,00020,480
8Jul 27, 2026 12:1959,689302,498,644281,911,00010,566,00020,480
9Jul 27, 2026 12:1959,747302,717,703282,716,00010,049,00020,480