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 listJun 6, 2026 19:15Victor MerckléVictor MerckléScore: 56,910Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 6, 2026 19:1656,816287,650,534276,214,0002,188,0002,113,536
2Jun 6, 2026 19:1656,879290,887,555276,559,0002,151,0002,113,536
3Jun 6, 2026 19:1656,888289,334,312276,698,0002,057,0002,113,536
4Jun 6, 2026 19:1656,893287,933,030276,586,0002,193,0002,113,536
5Jun 6, 2026 19:1656,910288,042,595276,641,0002,221,0002,113,536
6Jun 6, 2026 19:1656,911288,066,919276,808,0002,060,0002,113,536
7Jun 6, 2026 19:1656,918288,016,978276,826,0002,075,0002,113,536
8Jun 6, 2026 19:1657,699291,846,886280,624,0002,103,0002,113,536
9Jun 6, 2026 19:1658,163294,058,169282,946,0002,053,0002,113,536