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 10, 2026 00:24Victor MerckléVictor MerckléScore: 35,330Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 10, 2026 00:2534,896178,873,874168,916,0002,077,0002,117,632stderr
2Jul 10, 2026 00:2534,959179,407,246169,238,0002,062,0002,117,632stderr
3Jul 10, 2026 00:2535,134180,089,233170,075,0002,082,0002,117,632stderr
4Jul 10, 2026 00:2535,193180,563,807170,431,0002,019,0002,117,632stderr
5Jul 10, 2026 00:2535,330181,203,933170,953,0002,165,0002,117,632stderr
6Jul 10, 2026 00:2535,376181,355,959171,297,0002,050,0002,117,632stderr
7Jul 10, 2026 00:2535,447181,558,634171,555,0002,136,0002,117,632stderr
8Jul 10, 2026 00:2535,631182,611,096172,540,0002,053,0002,117,632stderr
9Jul 10, 2026 00:2535,661182,925,689172,636,0002,103,0002,117,632stderr