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:51Kevin HeaveyKevin HeaveyScore: 57,874Success
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 13:0957,427291,243,272270,157,00011,240,00020,480
2Jul 27, 2026 13:0957,531291,751,448270,303,00011,600,00020,480
3Jul 27, 2026 13:0957,545291,782,770270,338,00011,633,0002,113,536
4Jul 27, 2026 13:0957,864293,471,865270,085,00013,449,00020,480
5Jul 27, 2026 13:0957,874293,424,103270,143,00013,440,00020,480
6Jul 27, 2026 13:0957,978293,972,908270,077,00014,018,0002,113,536
7Jul 27, 2026 13:0958,008294,130,270269,973,00014,267,00020,480
8Jul 27, 2026 13:0958,014294,133,368270,127,00014,143,00020,480
9Jul 27, 2026 13:0958,809297,976,092274,023,00014,142,00020,480