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 2, 2026 02:44Victor MerckléVictor MerckléScore: 32,358Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 02:4432,343166,893,404157,463,0001,020,0002,117,632stderr
2Sep 2, 2026 02:4432,353166,958,462157,424,0001,106,0002,117,632stderr
3Sep 2, 2026 02:4432,358166,952,933157,450,0001,108,0002,117,632stderr
4Sep 2, 2026 02:4432,358166,979,636157,455,0001,104,0002,117,632stderr
5Sep 2, 2026 02:4432,358166,973,087157,466,0001,089,0002,117,632stderr
6Sep 2, 2026 02:4432,360166,918,798157,451,0001,117,0002,117,632stderr
7Sep 2, 2026 02:4432,362166,970,495157,455,0001,121,0002,117,632stderr
8Sep 2, 2026 02:4432,368167,050,180157,501,0001,106,0002,117,632stderr
9Sep 2, 2026 02:4432,383167,055,345157,578,0001,101,0002,117,632stderr