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:25anboto1anboto1Score: 147,682Success
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:26147,404732,338,745720,098,0002,186,0002,113,536
2Jul 31, 2026 19:26147,607733,313,561721,046,0002,230,0002,113,536
3Jul 31, 2026 19:26147,617733,815,038721,245,0002,081,0002,113,536
4Jul 31, 2026 19:26147,669733,647,879721,420,0002,160,0002,113,536
5Jul 31, 2026 19:26147,682734,428,233721,381,0002,261,0002,113,536
6Jul 31, 2026 19:26147,997735,188,460723,143,0002,046,0002,113,536
7Jul 31, 2026 19:26155,552772,155,314760,046,0002,160,0002,113,536
8Jul 31, 2026 19:26156,812779,055,518766,187,0002,194,0002,113,536
9Jul 31, 2026 19:26158,431786,275,595774,147,0002,169,0002,113,536