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 9, 2026 22:20Victor MerckléVictor MerckléScore: 31,114Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 22:2131,002160,010,727150,906,0001,008,0002,117,632stderr
2Jul 9, 2026 22:2131,008160,044,184150,933,0001,010,0002,117,632stderr
3Jul 9, 2026 22:2131,015160,118,938150,965,0001,009,0002,117,632stderr
4Jul 9, 2026 22:2131,093160,415,722151,350,0001,008,0002,117,632stderr
5Jul 9, 2026 22:2131,114160,265,701151,454,0001,009,0002,117,632stderr
6Jul 9, 2026 22:2131,149160,519,252151,624,0001,009,0002,117,632stderr
7Jul 9, 2026 22:2131,237161,027,473152,054,0001,012,0002,117,632stderr
8Jul 9, 2026 22:2131,245161,139,982152,095,0001,010,0002,117,632stderr
9Jul 9, 2026 22:2131,967164,524,997155,632,0001,011,0002,117,632stderr