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 listAug 3, 2026 22:08anboto1anboto1Score: 57,503Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 22:0857,192288,742,269279,138,0001,105,0002,113,536
2Aug 3, 2026 22:0857,276289,096,788279,562,0001,095,0002,113,536
3Aug 3, 2026 22:0857,339289,426,083279,928,0001,036,0002,113,536
4Aug 3, 2026 22:0857,431289,545,633280,318,0001,098,0002,113,536
5Aug 3, 2026 22:0857,503290,254,829280,674,0001,091,0002,113,536
6Aug 3, 2026 22:0857,902292,140,436282,646,0001,078,0002,113,536
7Aug 3, 2026 22:0858,027292,832,380283,233,0001,100,0002,113,536
8Aug 3, 2026 22:0858,544297,339,725285,776,0001,090,0002,113,536
9Aug 3, 2026 22:0858,573295,500,327285,892,0001,119,0002,113,536