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 17:21Victor MerckléVictor MerckléScore: 48,171Success
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 17:2248,100244,907,897233,570,0002,122,0002,117,632stderr
2Jul 3, 2026 17:2248,129243,824,658233,731,0002,102,0002,117,632stderr
3Jul 3, 2026 17:2248,135243,819,871233,846,0002,019,0002,117,632stderr
4Jul 3, 2026 17:2248,137243,814,411233,861,0002,013,0002,117,632stderr
5Jul 3, 2026 17:2248,171243,948,920233,850,0002,192,0002,117,632stderr
6Jul 3, 2026 17:2248,175244,054,620234,034,0002,024,0002,117,632stderr
7Jul 3, 2026 17:2248,253244,371,429234,422,0002,018,0002,117,632stderr
8Jul 3, 2026 17:2248,262244,418,452234,282,0002,206,0002,117,632stderr
9Jul 3, 2026 17:2248,732246,744,625236,611,0002,178,0002,117,632stderr