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 12:46Josu San MartinJosu San MartinScore: 25,412Success
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 12:4725,361133,309,772123,010,0001,259,0002,113,536
2Aug 4, 2026 12:4725,395132,952,915123,174,0001,265,0002,113,536
3Aug 4, 2026 12:4725,408133,573,440123,243,0001,260,0002,113,536
4Aug 4, 2026 12:4725,409133,338,632123,241,0001,264,0002,113,536
5Aug 4, 2026 12:4725,412133,624,067123,270,0001,252,0002,113,536
6Aug 4, 2026 12:4725,422132,807,685123,309,0001,262,0002,113,536
7Aug 4, 2026 12:4725,433132,974,762123,362,0001,260,0002,113,536
8Aug 4, 2026 12:4725,446133,763,852123,423,0001,266,0002,113,536
9Aug 4, 2026 12:4725,450133,855,316123,443,0001,266,0002,113,536