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 3, 2026 20:57Victor MerckléVictor MerckléScore: 25,452Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 20:5725,424133,732,228123,471,0001,111,0002,117,632stderr
2Sep 3, 2026 20:5725,442133,121,247123,567,0001,101,0002,117,632stderr
3Sep 3, 2026 20:5725,444133,108,047123,577,0001,103,0002,117,632stderr
4Sep 3, 2026 20:5725,452133,219,217123,619,0001,099,0002,117,632stderr
5Sep 3, 2026 20:5725,452133,124,083123,626,0001,090,0002,117,632stderr
6Sep 3, 2026 20:5725,452133,187,568123,628,0001,091,0002,117,632stderr
7Sep 3, 2026 20:5725,454133,256,806123,594,0001,132,0002,117,632stderr
8Sep 3, 2026 20:5725,460133,226,448123,557,0001,200,0002,117,632stderr
9Sep 3, 2026 20:5725,484133,459,741123,781,0001,091,0002,117,632stderr