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:28anboto1anboto1Score: 57,718Success
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:2957,555290,462,809280,861,0001,163,0002,113,536
2Aug 3, 2026 21:2957,603290,778,659281,152,0001,106,0002,113,536
3Aug 3, 2026 21:2957,616290,788,185281,216,0001,104,0002,113,536
4Aug 3, 2026 21:2957,635291,527,830281,275,0001,138,0002,113,536
5Aug 3, 2026 21:2957,718292,067,924281,703,0001,118,0002,113,536
6Aug 3, 2026 21:2957,723291,345,058281,582,0001,265,0002,113,536
7Aug 3, 2026 21:2958,090292,918,653283,552,0001,089,0002,113,536
8Aug 3, 2026 21:2959,056298,417,745288,189,0001,187,0002,113,536
9Aug 3, 2026 21:2959,122298,235,431288,490,0001,209,0002,113,536