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 listJan 23, 2026 16:03Josu San MartinJosu San MartinScore: 86,161Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 23, 2026 16:0386,080447,728,062418,793,0002,998,0002,273,280
2Jan 23, 2026 16:0386,110445,950,080419,939,0001,999,0002,269,184
3Jan 23, 2026 16:0386,115455,452,909419,966,0001,999,0002,269,184
4Jan 23, 2026 16:0386,152448,399,161415,142,0007,002,0002,269,184
5Jan 23, 2026 16:0386,161451,649,716418,188,0004,001,0002,269,184
6Jan 23, 2026 16:0386,175445,451,608420,257,0002,001,0002,269,184
7Jan 23, 2026 16:0386,185451,691,875419,312,0002,995,0002,400,256
8Jan 23, 2026 16:0386,214451,975,814421,446,0001,001,0002,273,280
9Jan 23, 2026 16:0386,229448,632,290420,526,0001,997,0002,269,184