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 listMar 28, 2026 20:31Dominique GarmierDominique GarmierScore: 228,802Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 28, 2026 20:34228,7521,146,812,2481,118,886,0001,999,0002,293,760
2Mar 28, 2026 20:34228,7731,144,894,7041,116,990,0003,999,0002,527,232
3Mar 28, 2026 20:31228,7751,142,432,9071,118,997,0001,999,0002,334,720
4Mar 28, 2026 20:31228,8021,153,561,3851,119,130,0001,998,0002,347,008
5Mar 28, 2026 20:34228,8401,149,535,9441,118,317,0002,998,0002,334,720
6Mar 28, 2026 20:31228,8601,149,010,5381,117,419,0003,997,0002,531,328