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 27, 2026 13:49Kevin HeaveyKevin HeaveyScore: 53,208Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 27, 2026 14:1752,810268,890,223248,169,00010,601,00020,480
2Jul 27, 2026 14:1752,811268,876,217248,024,00010,754,00020,480
3Jul 27, 2026 14:1752,820268,872,428248,863,0009,957,0002,113,536
4Jul 27, 2026 14:1753,158270,630,493248,038,00012,437,00020,480
5Jul 27, 2026 14:1753,208270,827,005249,375,00011,347,00020,480
6Jul 27, 2026 14:1753,229271,620,158248,142,00012,681,0002,113,536
7Jul 27, 2026 14:1753,266271,717,761248,182,00012,823,00020,480
8Jul 27, 2026 14:1753,337271,402,330247,924,00013,432,0002,113,536
9Jul 27, 2026 14:1753,348271,615,549247,993,00013,414,00020,480