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 29, 2026 01:33Josu San MartinJosu San MartinScore: 24,282Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 29, 2026 01:3324,261127,306,746117,626,0001,257,0002,113,536
2Aug 29, 2026 01:3324,266127,326,781117,642,0001,265,0002,113,536
3Aug 29, 2026 01:3324,266127,381,708117,652,0001,252,0002,113,536
4Aug 29, 2026 01:3324,270127,348,293117,655,0001,270,0002,113,536
5Aug 29, 2026 01:3324,282127,430,556117,969,0001,016,0002,113,536
6Aug 29, 2026 01:3324,283127,366,459117,727,0001,264,0002,113,536
7Aug 29, 2026 01:3324,291127,974,729117,776,0001,252,0002,113,536
8Aug 29, 2026 01:3324,380128,466,078118,220,0001,244,0002,113,536
9Aug 29, 2026 01:3324,569128,805,793119,136,0001,256,0002,113,536