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 10, 2026 00:14Victor MerckléVictor MerckléScore: 29,285Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:1529,068150,284,443140,424,0002,012,0002,117,632stderr
2Jul 10, 2026 00:1529,188150,970,546140,994,0002,031,0002,117,632stderr
3Jul 10, 2026 00:1529,251151,510,031142,322,0001,009,0002,117,632stderr
4Jul 10, 2026 00:1529,262151,521,332142,378,0001,009,0002,117,632stderr
5Jul 10, 2026 00:1529,285151,363,947142,490,0001,009,0002,117,632stderr
6Jul 10, 2026 00:1529,335151,910,750141,728,0002,014,0002,117,632stderr
7Jul 10, 2026 00:1529,346151,894,212142,790,0001,010,0002,117,632stderr
8Jul 10, 2026 00:1529,497152,610,161142,527,0002,013,0002,117,632stderr
9Jul 10, 2026 00:1529,673153,442,585144,391,0001,010,0002,117,632stderr