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 21:57Victor MerckléVictor MerckléScore: 50,395Success
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 21:5950,312254,482,029244,456,0002,076,0002,117,632stderr
2Jul 3, 2026 21:5950,386254,824,848244,859,0002,033,0002,117,632stderr
3Jul 3, 2026 21:5950,387254,792,467244,797,0002,102,0002,117,632stderr
4Jul 3, 2026 21:5950,390256,235,489244,820,0002,095,0002,117,632stderr
5Jul 3, 2026 21:5950,395254,875,545244,895,0002,044,0002,117,632stderr
6Jul 3, 2026 21:5950,418255,007,934244,895,0002,158,0002,117,632stderr
7Jul 3, 2026 21:5950,496255,349,038245,348,0002,084,0002,117,632stderr
8Jul 3, 2026 21:5950,589255,808,473245,848,0002,042,0002,117,632stderr
9Jul 3, 2026 21:5950,928257,478,966247,508,0002,042,0002,117,632stderr