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 21:47Victor MerckléVictor MerckléScore: 25,498Success
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 21:4825,466133,290,732123,766,0001,022,0002,117,632stderr
2Sep 3, 2026 21:4825,471133,250,514123,782,0001,030,0002,117,632stderr
3Sep 3, 2026 21:4825,481133,277,921123,760,0001,098,0002,117,632stderr
4Sep 3, 2026 21:4825,486134,888,040123,731,0001,153,0002,117,632stderr
5Sep 3, 2026 21:4825,498133,417,770123,766,0001,175,0002,117,632stderr
6Sep 3, 2026 21:4825,502133,430,667123,869,0001,094,0002,117,632stderr
7Sep 3, 2026 21:4825,507133,529,289123,888,0001,100,0002,117,632stderr
8Sep 3, 2026 21:4825,512133,445,291123,917,0001,094,0002,117,632stderr
9Sep 3, 2026 21:4825,518133,785,847123,953,0001,090,0002,117,632stderr