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 18:02anboto1anboto1Score: 147,174Success
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 18:03147,064730,682,692719,546,0001,071,0002,113,536
2Jul 31, 2026 18:03147,117730,894,586719,785,0001,093,0002,113,536
3Jul 31, 2026 18:03147,151731,073,797718,916,0002,127,0002,113,536
4Jul 31, 2026 18:03147,166731,011,143720,038,0001,078,0002,113,536
5Jul 31, 2026 18:03147,174731,129,431720,071,0001,084,0002,113,536
6Jul 31, 2026 18:03147,198731,201,280720,207,0001,065,0002,113,536
7Jul 31, 2026 18:03147,426732,342,029721,309,0001,083,0002,113,536
8Jul 31, 2026 18:03147,446732,342,721721,400,0001,086,0002,113,536
9Jul 31, 2026 18:03147,511732,792,307721,727,0001,079,0002,113,536