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 29, 2026 20:42lipapipalipapipaScore: 183,548Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 29, 2026 20:42183,532923,911,273896,311,0002,997,0002,322,432
2Jan 29, 2026 20:42183,537932,159,221898,331,000999,0002,433,024
3Jan 29, 2026 20:42183,543927,543,465897,361,0001,998,0002,318,336
4Jan 29, 2026 20:42183,546931,828,367896,378,0002,997,0002,375,680
5Jan 29, 2026 20:42183,548931,480,301897,389,0001,998,0002,375,680
6Jan 29, 2026 20:42183,568932,813,244897,484,0001,998,0002,375,680
7Jan 29, 2026 20:42183,573923,381,959897,512,0001,998,0002,326,528
8Jan 29, 2026 20:42183,584926,898,372896,564,0002,998,0002,322,432
9Jan 29, 2026 20:42183,585927,871,469896,570,0002,998,0002,375,680