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 3, 2026 07:37Victor MerckléVictor MerckléScore: 49,800Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 3, 2026 07:3749,731251,575,787241,631,0002,051,0002,117,632stderr
2Jul 3, 2026 07:3749,771251,858,700241,848,0002,032,0002,117,632stderr
3Jul 3, 2026 07:3749,790251,957,422241,927,0002,044,0002,117,632stderr
4Jul 3, 2026 07:3749,796252,361,526241,948,0002,057,0002,117,632stderr
5Jul 3, 2026 07:3749,800251,928,637241,994,0002,027,0002,117,632stderr
6Jul 3, 2026 07:3749,815252,094,604243,092,0001,006,0002,117,632stderr
7Jul 3, 2026 07:3749,834252,073,122242,142,0002,048,0002,117,632stderr
8Jul 3, 2026 07:3749,950252,679,167242,717,0002,039,0002,117,632stderr
9Jul 3, 2026 07:3750,244257,103,762244,119,0002,077,0002,117,632stderr