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 14:00Kevin HeaveyKevin HeaveyScore: 51,910Success
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:2051,572263,793,999242,666,00010,041,00020,480
2Jul 27, 2026 14:2051,601262,912,078242,645,00010,201,00020,480
3Jul 27, 2026 14:2051,678263,293,734242,880,00010,343,00020,480
4Jul 27, 2026 14:2051,895264,359,508242,595,00011,693,00020,480
5Jul 27, 2026 14:2051,910266,952,444242,692,00011,671,00020,480
6Jul 27, 2026 14:2052,008264,800,832242,460,00012,380,00020,480
7Jul 27, 2026 14:2052,030265,621,187242,706,00012,243,00020,480
8Jul 27, 2026 14:2052,156265,690,877242,714,00012,853,00020,480
9Jul 27, 2026 14:2055,841283,767,167260,007,00013,617,0002,113,536