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 listJul 19, 2026 09:50Andrew TsibinAndrew TsibinScore: 101,322Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 19, 2026 09:51101,233505,795,554493,838,0002,208,00024,576
2Jul 19, 2026 09:51101,254506,603,184494,006,0002,142,00024,576
3Jul 19, 2026 09:51101,285506,048,769493,928,0002,369,00024,576
4Jul 19, 2026 09:51101,288506,119,831494,027,0002,289,00024,576
5Jul 19, 2026 09:51101,322506,779,480494,317,0002,162,00024,576
6Jul 19, 2026 09:51101,331506,231,506494,361,0002,163,00024,576
7Jul 19, 2026 09:51101,331506,405,433494,305,0002,221,00024,576
8Jul 19, 2026 09:51101,358506,408,862494,461,0002,196,00024,576
9Jul 19, 2026 09:51101,491507,010,235495,054,0002,256,00024,576