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 5, 2026 13:03Josu San MartinJosu San MartinScore: 25,198Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 5, 2026 13:0325,102131,551,956121,751,0001,250,0002,113,536
2Aug 5, 2026 13:0325,113131,427,243122,037,0001,018,0002,113,536
3Aug 5, 2026 13:0325,144131,653,481121,950,0001,258,0002,113,536
4Aug 5, 2026 13:0325,183131,880,186122,142,0001,257,0002,113,536
5Aug 5, 2026 13:0325,198132,417,393122,209,0001,264,0002,113,536
6Aug 5, 2026 13:0325,199131,871,348122,227,0001,252,0002,113,536
7Aug 5, 2026 13:0325,203132,018,794122,233,0001,264,0002,113,536
8Aug 5, 2026 13:0325,214131,931,453122,295,0001,254,0002,113,536
9Aug 5, 2026 13:0325,266132,280,972122,533,0001,274,0002,113,536