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 22:12Victor MerckléVictor MerckléScore: 25,508Success
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 22:1325,462133,187,916123,739,0001,028,0002,117,632stderr
2Sep 3, 2026 22:1325,483133,401,531123,763,0001,104,0002,117,632stderr
3Sep 3, 2026 22:1325,490133,336,360123,812,0001,090,0002,117,632stderr
4Sep 3, 2026 22:1325,507133,815,903123,889,0001,099,0002,117,632stderr
5Sep 3, 2026 22:1325,508133,482,671123,899,0001,091,0002,117,632stderr
6Sep 3, 2026 22:1325,517133,544,424123,945,0001,093,0002,117,632stderr
7Sep 3, 2026 22:1325,518133,525,154123,949,0001,094,0002,117,632stderr
8Sep 3, 2026 22:1325,526133,571,808123,971,0001,107,0002,117,632stderr
9Sep 3, 2026 22:1325,526133,835,123123,968,0001,113,0002,117,632stderr