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 listJun 4, 2026 23:57Victor MerckléVictor MerckléScore: 63,175Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 4, 2026 23:5862,998316,723,121306,669,0002,022,0002,113,536
2Jun 4, 2026 23:5863,050316,683,335306,932,0002,015,0002,113,536
3Jun 4, 2026 23:5863,096316,938,522308,167,0001,006,0002,113,536
4Jun 4, 2026 23:5863,123316,902,976308,298,0001,006,0002,113,536
5Jun 4, 2026 23:5863,175317,394,468308,555,0001,006,0002,113,536
6Jun 4, 2026 23:5863,203317,395,036308,692,0001,005,0002,113,536
7Jun 4, 2026 23:5863,518319,789,863310,235,0001,006,0002,113,536
8Jun 4, 2026 23:5864,139322,054,286312,254,0002,028,0002,113,536
9Jun 4, 2026 23:5864,409323,154,666314,602,0001,006,0002,113,536