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 3, 2026 20:50Victor MerckléVictor MerckléScore: 25,441Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 20:5225,405132,887,486123,466,0001,020,0002,117,632stderr
2Sep 3, 2026 20:5225,425133,644,842123,536,0001,050,0002,117,632stderr
3Sep 3, 2026 20:5225,431133,101,143123,518,0001,094,0002,117,632stderr
4Sep 3, 2026 20:5225,440133,097,416123,538,0001,121,0002,117,632stderr
5Sep 3, 2026 20:5225,441133,080,551123,569,0001,095,0002,117,632stderr
6Sep 3, 2026 20:5225,444133,222,278123,572,0001,105,0002,117,632stderr
7Sep 3, 2026 20:5225,447133,957,463123,605,0001,090,0002,117,632stderr
8Sep 3, 2026 20:5225,456133,894,522123,631,0001,104,0002,117,632stderr
9Sep 3, 2026 20:5225,457133,220,623123,586,0001,154,0002,117,632stderr