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 listSep 2, 2026 04:25Victor MerckléVictor MerckléScore: 26,378Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 2, 2026 04:2626,350137,621,342128,011,0001,105,0002,117,632stderr
2Sep 2, 2026 04:2626,357138,756,166128,039,0001,112,0002,117,632stderr
3Sep 2, 2026 04:2626,373137,675,583128,135,0001,094,0002,117,632stderr
4Sep 2, 2026 04:2626,377138,027,093128,148,0001,102,0002,117,632stderr
5Sep 2, 2026 04:2626,378137,679,772128,132,0001,124,0002,117,632stderr
6Sep 2, 2026 04:2626,381137,666,159128,168,0001,100,0002,117,632stderr
7Sep 2, 2026 04:2626,381137,725,588128,171,0001,096,0002,117,632stderr
8Sep 2, 2026 04:2626,387137,778,975128,187,0001,110,0002,117,632stderr
9Sep 2, 2026 04:2626,396137,740,146128,333,0001,011,0002,117,632stderr