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:07Victor MerckléVictor MerckléScore: 25,773Success
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:0925,750134,628,450125,085,0001,094,0002,117,632stderr
2Sep 3, 2026 21:0925,760134,655,026125,126,0001,098,0002,117,632stderr
3Sep 3, 2026 21:0925,769134,723,508125,161,0001,108,0002,117,632stderr
4Sep 3, 2026 21:0925,770134,862,294125,176,0001,100,0002,117,632stderr
5Sep 3, 2026 21:0925,773134,861,431125,138,0001,151,0002,117,632stderr
6Sep 3, 2026 21:0925,776134,838,686125,211,0001,094,0002,117,632stderr
7Sep 3, 2026 21:0925,783134,823,254125,246,0001,092,0002,117,632stderr
8Sep 3, 2026 21:0925,795134,894,132125,306,0001,091,0002,117,632stderr
9Sep 3, 2026 21:0925,804134,674,700125,338,0001,105,0002,117,632stderr