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:43anboto1anboto1Score: 127,680Success
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:44126,933632,258,526620,566,0001,410,0002,113,536
2Jul 31, 2026 21:44127,057633,672,578621,213,0001,368,0002,113,536
3Jul 31, 2026 21:44127,124633,024,507621,541,0001,371,0002,113,536
4Jul 31, 2026 21:44127,411634,691,666622,903,0001,412,0002,113,536
5Jul 31, 2026 21:44127,680635,973,355624,279,0001,355,0002,113,536
6Jul 31, 2026 21:44128,605640,292,966628,807,0001,361,0002,113,536
7Jul 31, 2026 21:44128,865641,579,243629,363,0002,076,0002,113,536
8Jul 31, 2026 21:44129,385644,113,592632,629,0001,359,0002,113,536
9Jul 31, 2026 21:44129,637645,349,993633,867,0001,359,0002,113,536