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 23:43Victor MerckléVictor MerckléScore: 25,518Success
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 23:4425,462133,265,814123,741,0001,023,0002,117,632stderr
2Sep 3, 2026 23:4425,471133,335,349123,768,0001,043,0002,117,632stderr
3Sep 3, 2026 23:4425,496133,440,787123,826,0001,109,0002,117,632stderr
4Sep 3, 2026 23:4425,502133,480,658123,860,0001,103,0002,117,632stderr
5Sep 3, 2026 23:4425,518134,682,337123,902,0001,141,0002,117,632stderr
6Sep 3, 2026 23:4425,521133,706,061123,949,0001,108,0002,117,632stderr
7Sep 3, 2026 23:4425,528133,573,927123,980,0001,109,0002,117,632stderr
8Sep 3, 2026 23:4425,545133,384,135124,067,0001,108,0002,117,632stderr
9Sep 3, 2026 23:4425,551133,731,457124,072,0001,129,0002,117,632stderr