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: 52,403Success
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:2252,004264,969,616246,477,0008,345,0002,113,536
2Jul 27, 2026 14:2252,143265,608,410246,608,0008,894,00020,480
3Jul 27, 2026 14:2252,339266,552,226246,537,0009,927,0002,113,536
4Jul 27, 2026 14:2252,353266,496,755246,437,00010,095,0002,113,536
5Jul 27, 2026 14:2252,403266,870,194246,140,00010,638,0002,113,536
6Jul 27, 2026 14:2252,596267,767,426247,112,00010,613,00020,480
7Jul 27, 2026 14:2252,700268,248,324247,064,00011,168,0002,113,536
8Jul 27, 2026 14:2252,723269,197,264246,381,00011,963,00020,480
9Jul 27, 2026 14:2252,779268,691,443246,739,00011,880,00020,480