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 24, 2026 14:28Andrew EpsteinAndrew EpsteinScore: 317,003Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 14:30313,3131,546,500,6841,532,892,0002,346,0002,117,632stderr
2Sep 24, 2026 14:30316,4001,560,889,7171,549,238,0001,124,0002,117,632stderr
3Sep 24, 2026 14:30316,4061,561,831,1501,548,114,0002,278,0002,117,632stderr
4Sep 24, 2026 14:30316,9051,563,417,5191,551,710,0001,127,0002,121,728stderr
5Sep 24, 2026 14:30317,0031,564,584,8351,552,209,0001,108,0002,117,632stderr
6Sep 24, 2026 14:30317,1031,565,025,4761,552,702,0001,104,0002,117,632stderr
7Sep 24, 2026 14:30317,2851,565,220,1471,553,469,0001,232,0002,117,632stderr
8Sep 24, 2026 14:30317,9701,569,255,7741,556,944,0001,110,0002,117,632stderr
9Sep 24, 2026 14:30361,1971,780,410,4871,768,756,0001,113,0002,117,632stderr