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 19, 2026 20:04olliecrowolliecrowScore: 93,992Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 19, 2026 22:5193,715488,253,795458,203,0001,000,0002,277,376
2Mar 19, 2026 22:5193,720484,361,986458,228,0001,000,0002,277,376
3Mar 19, 2026 22:5193,726482,171,081458,258,0001,000,0002,277,376
4Mar 19, 2026 20:0493,992487,071,740458,563,0001,998,0002,273,280
5Mar 19, 2026 20:0494,236504,853,048460,756,0001,001,0002,273,280
6Mar 19, 2026 20:0494,991496,653,015459,452,0006,005,0002,273,280