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 listJan 22, 2026 22:56Josu San MartinJosu San MartinScore: 133,616Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 22, 2026 22:33133,575681,386,656652,519,0001,998,0002,269,184
2Jan 22, 2026 22:56133,577680,532,565652,531,0001,998,0002,281,472
3Jan 22, 2026 22:33133,598685,034,972651,630,0002,998,0002,281,472
4Jan 22, 2026 22:56133,616683,067,806652,719,0001,999,0002,281,472
5Jan 22, 2026 22:56133,659681,946,318651,932,0002,999,0002,281,472
6Jan 22, 2026 22:33134,149683,970,994656,333,000998,0002,265,088