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 21:45anboto1anboto1Score: 128,406Success
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 21:46127,986637,188,455625,789,0001,343,0002,113,536
2Jul 31, 2026 21:46127,995637,347,952625,831,0001,348,0002,113,536
3Jul 31, 2026 21:46128,268638,736,060627,166,0001,351,0002,113,536
4Jul 31, 2026 21:46128,323639,162,244627,421,0001,362,0002,113,536
5Jul 31, 2026 21:46128,406639,348,731627,836,0001,358,0002,113,536
6Jul 31, 2026 21:46128,639640,436,559628,974,0001,359,0002,113,536
7Jul 31, 2026 21:46128,743641,030,398629,483,0001,360,0002,113,536
8Jul 31, 2026 21:46129,712645,720,713634,225,0001,367,0002,113,536
9Jul 31, 2026 21:46130,937651,733,060640,237,0001,359,0002,113,536