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 21:54Josu San MartinJosu San MartinScore: 29,764Success
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 21:5529,732156,450,472144,575,0001,115,0002,113,536
2Aug 2, 2026 21:5529,740156,309,306144,605,0001,125,0002,113,536
3Aug 2, 2026 21:5529,748156,493,832144,631,0001,136,0002,113,536
4Aug 2, 2026 21:5529,761155,850,012144,722,0001,108,0002,113,536
5Aug 2, 2026 21:5529,764155,868,584144,717,0001,130,0002,113,536
6Aug 2, 2026 21:5529,767156,587,347144,729,0001,133,0002,113,536
7Aug 2, 2026 21:5529,770156,821,069144,737,0001,137,0002,113,536
8Aug 2, 2026 21:5530,048158,038,127146,115,0001,121,0002,113,536
9Aug 2, 2026 21:5530,145158,545,269146,588,0001,124,0002,113,536