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 listMay 11, 2026 18:03Victor MerckléVictor MerckléScore: 64,769Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 11, 2026 18:0464,237325,690,701312,545,0002,221,0002,113,536
2May 11, 2026 18:0464,706327,084,235315,021,0002,041,0002,113,536
3May 11, 2026 18:0464,753327,332,130315,072,0002,222,0002,113,536
4May 11, 2026 18:0464,768329,085,984315,250,0002,114,0002,113,536
5May 11, 2026 18:0464,769326,279,076315,190,0002,180,0002,113,536
6May 11, 2026 18:0464,795326,407,396315,346,0002,150,0002,113,536
7May 11, 2026 18:0464,806326,697,427315,444,0002,106,0002,113,536
8May 11, 2026 18:0464,833329,388,911315,600,0002,085,0002,113,536
9May 11, 2026 18:0464,845326,723,401315,728,0002,013,0002,113,536