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 31, 2026 19:54anboto1anboto1Score: 196,822Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 19:54195,666968,946,004957,542,0001,222,0002,113,536
2Jul 31, 2026 19:54195,725969,256,615957,822,0001,234,0002,113,536
3Jul 31, 2026 19:54196,023973,656,928958,255,0002,262,0002,113,536
4Jul 31, 2026 19:54196,534973,315,640961,786,0001,234,0002,113,536
5Jul 31, 2026 19:54196,822975,540,411962,160,0002,272,0002,113,536
6Jul 31, 2026 19:54196,858974,724,501963,393,0001,215,0002,113,536
7Jul 31, 2026 19:54198,118981,006,625969,551,0001,230,0002,113,536
8Jul 31, 2026 19:54199,323986,972,469975,309,0001,378,0002,113,536
9Jul 31, 2026 19:54200,436992,386,925980,900,0001,237,0002,113,536