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 23:35Victor MerckléVictor MerckléScore: 47,678Success
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 23:3647,514240,721,112230,782,0002,041,0002,117,632stderr
2Jul 3, 2026 23:3647,597241,192,492231,205,0002,023,0002,117,632stderr
3Jul 3, 2026 23:3647,606241,198,967231,229,0002,044,0002,117,632stderr
4Jul 3, 2026 23:3647,645241,456,418231,448,0002,013,0002,117,632stderr
5Jul 3, 2026 23:3647,678241,546,907231,608,0002,019,0002,117,632stderr
6Jul 3, 2026 23:3647,866242,816,071232,522,0002,023,0002,117,632stderr
7Jul 3, 2026 23:3647,877242,638,766232,589,0002,011,0002,117,632stderr
8Jul 3, 2026 23:3647,902242,704,302232,709,0002,015,0002,117,632stderr
9Jul 3, 2026 23:3648,698246,525,488236,613,0002,012,0002,117,632stderr