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 9, 2026 23:52Victor MerckléVictor MerckléScore: 30,007Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 23:5329,618152,949,554144,121,0001,009,0002,117,632stderr
2Jul 9, 2026 23:5329,755153,952,571144,792,0001,012,0002,117,632stderr
3Jul 9, 2026 23:5329,828154,056,891145,151,0001,010,0002,117,632stderr
4Jul 9, 2026 23:5329,855154,178,185145,285,0001,008,0002,117,632stderr
5Jul 9, 2026 23:5330,007154,930,335146,029,0001,010,0002,117,632stderr
6Jul 9, 2026 23:5330,110155,823,593146,531,0001,010,0002,117,632stderr
7Jul 9, 2026 23:5330,196156,013,407146,955,0001,009,0002,117,632stderr
8Jul 9, 2026 23:5330,431157,216,852148,106,0001,008,0002,117,632stderr
9Jul 9, 2026 23:5331,131160,623,832151,535,0001,011,0002,117,632stderr