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 listJun 19, 2026 18:53Victor MerckléVictor MerckléScore: 49,423Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2026 18:5449,411249,786,921240,021,0002,095,0002,113,536
2Jun 19, 2026 18:5449,414250,026,543240,088,0002,042,0002,113,536
3Jun 19, 2026 18:5449,417249,479,333240,132,0002,013,0002,113,536
4Jun 19, 2026 18:5449,419249,573,353240,110,0002,044,0002,113,536
5Jun 19, 2026 18:5449,423249,879,272240,171,0002,004,0002,113,536
6Jun 19, 2026 18:5449,429249,879,500240,143,0002,063,0002,113,536
7Jun 19, 2026 18:5449,516250,712,004240,560,0002,073,0002,113,536
8Jun 19, 2026 18:5449,962252,442,190242,809,0002,008,0002,113,536
9Jun 19, 2026 18:5450,043253,180,256243,163,0002,050,0002,113,536