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 1, 2026 08:31Josu San MartinJosu San MartinScore: 35,725Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 1, 2026 08:3235,708185,049,281173,872,0001,098,0002,113,536
2Aug 1, 2026 08:3235,717185,053,961173,888,0001,130,0002,113,536
3Aug 1, 2026 08:3235,722185,299,768173,919,0001,122,0002,113,536
4Aug 1, 2026 08:3235,722185,865,030173,915,0001,125,0002,113,536
5Aug 1, 2026 08:3235,725185,235,554173,928,0001,126,0002,113,536
6Aug 1, 2026 08:3235,726185,292,428173,937,0001,121,0002,113,536
7Aug 1, 2026 08:3235,730185,957,845173,966,0001,115,0002,113,536
8Aug 1, 2026 08:3235,736185,234,673174,000,0001,108,0002,113,536
9Aug 1, 2026 08:3235,743185,337,372174,027,0001,115,0002,113,536