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 22:21Victor MerckléVictor MerckléScore: 25,281Success
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 22:2225,237132,178,630122,607,0001,056,0002,117,632stderr
2Sep 3, 2026 22:2225,258132,249,965122,674,0001,093,0002,117,632stderr
3Sep 3, 2026 22:2225,265132,393,644122,696,0001,104,0002,117,632stderr
4Sep 3, 2026 22:2225,279132,451,974122,754,0001,117,0002,117,632stderr
5Sep 3, 2026 22:2225,281132,401,222122,752,0001,127,0002,117,632stderr
6Sep 3, 2026 22:2225,283132,393,680122,793,0001,095,0002,117,632stderr
7Sep 3, 2026 22:2225,283133,545,423122,731,0001,157,0002,117,632stderr
8Sep 3, 2026 22:2225,283132,460,767122,743,0001,148,0002,117,632stderr
9Sep 3, 2026 22:2225,305132,444,976122,872,0001,124,0002,117,632stderr