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 listJun 13, 2026 04:00Victor MerckléVictor MerckléScore: 57,018Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 13, 2026 04:0256,972288,114,696276,144,0003,021,0002,138,112
2Jun 13, 2026 04:0256,996288,648,546276,153,0003,129,0002,138,112
3Jun 13, 2026 04:0257,003288,495,292276,264,0003,053,0002,138,112
4Jun 13, 2026 04:0257,013288,256,291276,182,0003,184,0002,138,112
5Jun 13, 2026 04:0257,018290,096,936276,210,0003,180,0002,138,112
6Jun 13, 2026 04:0257,030288,334,483276,277,0003,172,0002,138,112
7Jun 13, 2026 04:0257,040288,419,992276,322,0003,175,0002,138,112
8Jun 13, 2026 04:0257,045288,711,043276,321,0003,204,0002,138,112
9Jun 13, 2026 04:0257,085288,817,673276,440,0003,278,0002,138,112