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 20:39Victor MerckléVictor MerckléScore: 49,725Success
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 20:4049,654251,619,522241,289,0002,016,0002,117,632stderr
2Jul 3, 2026 20:4049,680251,724,903241,393,0002,043,0002,117,632stderr
3Jul 3, 2026 20:4049,685251,767,820241,413,0002,045,0002,117,632stderr
4Jul 3, 2026 20:4049,686251,130,322241,441,0002,022,0002,117,632stderr
5Jul 3, 2026 20:4049,725251,554,768241,637,0002,019,0002,117,632stderr
6Jul 3, 2026 20:4049,737252,224,867241,500,0002,214,0002,117,632stderr
7Jul 3, 2026 20:4049,750251,749,219241,765,0002,013,0002,117,632stderr
8Jul 3, 2026 20:4051,496260,417,852250,312,0002,021,0002,117,632stderr
9Jul 3, 2026 20:4051,496260,682,176250,220,0002,115,0002,117,632stderr