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 21:17anboto1anboto1Score: 57,637Success
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 21:1857,578290,566,670281,034,0001,100,0002,113,536
2Aug 3, 2026 21:1857,588290,625,557281,094,0001,092,0002,113,536
3Aug 3, 2026 21:1857,613291,368,364281,221,0001,087,0002,113,536
4Aug 3, 2026 21:1857,615293,590,964281,136,0001,179,0002,113,536
5Aug 3, 2026 21:1857,637290,895,923281,257,0001,168,0002,113,536
6Aug 3, 2026 21:1857,670291,655,464281,477,0001,107,0002,113,536
7Aug 3, 2026 21:1857,686291,276,408281,553,0001,113,0002,113,536
8Aug 3, 2026 21:1857,704291,776,629281,651,0001,103,0002,113,536
9Aug 3, 2026 21:1857,733292,098,892281,798,0001,094,0002,113,536