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 12:08Kevin HeaveyKevin HeaveyScore: 60,700Success
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 12:2160,349305,775,895288,001,0007,711,00020,480
2Jul 27, 2026 12:2160,398306,062,236288,079,0007,876,00020,480
3Jul 27, 2026 12:2160,469306,284,350288,460,0007,840,00020,480
4Jul 27, 2026 12:2160,699307,496,065288,356,0009,070,00020,480
5Jul 27, 2026 12:2160,700307,468,848288,052,0009,381,00020,480
6Jul 27, 2026 12:2160,776307,857,897288,426,0009,377,00020,480
7Jul 27, 2026 12:2160,779307,857,389287,909,0009,910,0002,113,536
8Jul 27, 2026 12:2160,804307,937,677288,179,0009,764,00020,480
9Jul 27, 2026 12:2163,902323,155,136304,384,0008,740,00020,480