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 listAug 2, 2026 19:05Josu San MartinJosu San MartinScore: 35,290Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 19:0635,210182,497,896171,428,0001,103,0002,113,536
2Aug 2, 2026 19:0635,236183,506,785171,538,0001,122,0002,113,536
3Aug 2, 2026 19:0635,247183,492,002171,586,0001,125,0002,113,536
4Aug 2, 2026 19:0635,281183,026,459171,735,0001,145,0002,113,536
5Aug 2, 2026 19:0635,290182,923,792171,811,0001,113,0002,113,536
6Aug 2, 2026 19:0635,301183,069,399171,827,0001,150,0002,113,536
7Aug 2, 2026 19:0635,320183,124,784171,925,0001,145,0002,113,536
8Aug 2, 2026 19:0635,320183,110,471171,953,0001,119,0002,113,536
9Aug 2, 2026 19:0635,356183,692,682172,138,0001,108,0002,113,536