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 listAug 3, 2026 20:54anboto1anboto1Score: 58,048Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 20:5757,631291,472,751281,291,0001,101,0002,113,536
2Aug 3, 2026 20:5757,664293,058,685281,406,0001,149,0002,113,536
3Aug 3, 2026 20:5757,803292,875,762282,095,0001,142,0002,113,536
4Aug 3, 2026 20:5758,039293,593,058283,300,0001,094,0002,113,536
5Aug 3, 2026 20:5758,048292,888,446283,408,0001,029,0002,113,536
6Aug 3, 2026 20:5758,298294,222,105283,580,0002,084,0002,113,536
7Aug 3, 2026 20:5758,433294,758,915285,234,0001,090,0002,113,536
8Aug 3, 2026 20:5758,808296,789,646286,995,0001,169,0002,113,536
9Aug 3, 2026 20:5758,965298,036,550287,840,0001,093,0002,113,536