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 4, 2026 04:07Josu San MartinJosu San MartinScore: 27,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 04:0827,159142,182,221131,833,0001,250,0002,113,536
2Aug 4, 2026 04:0827,165141,611,207131,850,0001,259,0002,113,536
3Aug 4, 2026 04:0827,230141,895,784132,176,0001,254,0002,113,536
4Aug 4, 2026 04:0827,232143,368,338132,180,0001,259,0002,113,536
5Aug 4, 2026 04:0827,236142,548,978132,202,0001,259,0002,113,536
6Aug 4, 2026 04:0827,241141,667,208132,463,0001,021,0002,113,536
7Aug 4, 2026 04:0827,285142,144,387132,439,0001,259,0002,113,536
8Aug 4, 2026 04:0827,364143,172,042132,834,0001,253,0002,113,536
9Aug 4, 2026 04:0827,484143,670,372133,398,0001,276,0002,113,536