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 12, 2026 06:59Petsku01Petsku01Score: 532,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 12, 2026 06:59532,2572,634,016,3322,370,238,000237,823,0002,281,472
2Jan 12, 2026 07:13532,2752,641,085,6882,376,311,000231,835,0002,416,640
3Jan 12, 2026 07:13532,5602,635,479,2712,373,677,000235,868,0002,383,872
4Jan 12, 2026 06:59532,7902,633,969,9562,373,794,000236,879,0002,269,184
5Jan 12, 2026 06:59532,8832,641,137,6002,376,295,000234,831,0002,506,752
6Jan 12, 2026 07:13532,8852,643,428,6582,376,303,000234,832,0002,404,352