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 4, 2026 14:45Victor MerckléVictor MerckléScore: 52,030Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 4, 2026 14:4651,478260,273,864250,142,0002,105,0002,117,632stderr
2Jul 4, 2026 14:4651,872262,244,067253,172,0001,005,0002,117,632stderr
3Jul 4, 2026 14:4651,960262,539,083253,604,0001,004,0002,117,632stderr
4Jul 4, 2026 14:4651,979262,699,214253,696,0001,004,0002,117,632stderr
5Jul 4, 2026 14:4652,030263,297,047253,944,0001,003,0002,117,632stderr
6Jul 4, 2026 14:4652,340264,775,501254,447,0002,022,0002,117,632stderr
7Jul 4, 2026 14:4652,616266,277,801256,816,0001,004,0002,117,632stderr
8Jul 4, 2026 14:4652,641266,002,856256,941,0001,004,0002,117,632stderr
9Jul 4, 2026 14:4655,104278,017,998269,008,0001,005,0002,117,632stderr