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 5, 2026 04:36Victor MerckléVictor MerckléScore: 47,046Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 5, 2026 04:3746,950238,013,636228,047,0002,008,0002,117,632stderr
2Jul 5, 2026 04:3746,998238,257,831229,288,0001,007,0002,117,632stderr
3Jul 5, 2026 04:3747,025238,410,642229,416,0001,008,0002,117,632stderr
4Jul 5, 2026 04:3747,029238,568,389228,436,0002,008,0002,117,632stderr
5Jul 5, 2026 04:3747,046238,591,494228,498,0002,029,0002,117,632stderr
6Jul 5, 2026 04:3747,099238,814,441228,750,0002,036,0002,117,632stderr
7Jul 5, 2026 04:3747,349239,952,566229,826,0002,186,0002,117,632stderr
8Jul 5, 2026 04:3747,364239,848,103230,058,0002,030,0002,117,632stderr
9Jul 5, 2026 04:3747,651241,315,374231,458,0002,033,0002,117,632stderr