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 08:51Victor MerckléVictor MerckléScore: 32,143Success
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 08:5231,914164,577,122155,369,0001,010,0002,117,632stderr
2Jul 9, 2026 08:5231,996164,592,448155,773,0001,010,0002,117,632stderr
3Jul 9, 2026 08:5232,092165,102,195156,243,0001,011,0002,117,632stderr
4Jul 9, 2026 08:5232,105165,201,447156,306,0001,012,0002,117,632stderr
5Jul 9, 2026 08:5232,143165,654,918156,492,0001,011,0002,117,632stderr
6Jul 9, 2026 08:5232,169165,508,265156,619,0001,010,0002,117,632stderr
7Jul 9, 2026 08:5232,199165,670,225156,766,0001,013,0002,117,632stderr
8Jul 9, 2026 08:5232,201167,289,747156,777,0001,012,0002,117,632stderr
9Jul 9, 2026 08:5232,289166,163,858157,209,0001,010,0002,117,632stderr