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 2, 2026 20:12Josu San MartinJosu San MartinScore: 29,750Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 20:1329,702155,613,268144,434,0001,109,0002,113,536
2Aug 2, 2026 20:1329,707156,373,743144,430,0001,138,0002,113,536
3Aug 2, 2026 20:1329,713155,648,575144,455,0001,141,0002,113,536
4Aug 2, 2026 20:1329,717155,758,411144,510,0001,108,0002,113,536
5Aug 2, 2026 20:1329,750156,590,725144,645,0001,131,0002,113,536
6Aug 2, 2026 20:1329,760156,576,449144,534,0001,290,0002,113,536
7Aug 2, 2026 20:1329,852157,062,829145,136,0001,141,0002,113,536
8Aug 2, 2026 20:1329,904156,490,191145,412,0001,120,0002,113,536
9Aug 2, 2026 20:1329,992157,113,307145,840,0001,123,0002,113,536