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 listJul 3, 2026 20:00Victor MerckléVictor MerckléScore: 55,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 20:0055,060278,126,781267,676,0002,120,0002,117,632stderr
2Jul 3, 2026 20:0055,094277,982,446267,900,0002,063,0002,117,632stderr
3Jul 3, 2026 20:0055,101277,857,518267,862,0002,134,0002,117,632stderr
4Jul 3, 2026 20:0055,108278,109,587267,939,0002,091,0002,117,632stderr
5Jul 3, 2026 20:0055,122277,834,884268,015,0002,085,0002,117,632stderr
6Jul 3, 2026 20:0055,145278,112,278268,131,0002,084,0002,117,632stderr
7Jul 3, 2026 20:0055,228278,576,266268,566,0002,053,0002,117,632stderr
8Jul 3, 2026 20:0055,418279,456,400269,440,0002,110,0002,117,632stderr
9Jul 3, 2026 20:0055,489279,914,767269,798,0002,101,0002,117,632stderr