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 3, 2026 16:05Josu San MartinJosu San MartinScore: 27,717Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 16:0527,690144,066,142134,414,0001,268,0002,113,536
2Aug 3, 2026 16:0527,692144,754,846134,620,0001,074,0002,113,536
3Aug 3, 2026 16:0527,702144,878,859134,481,0001,260,0002,113,536
4Aug 3, 2026 16:0527,711144,845,812134,515,0001,269,0002,113,536
5Aug 3, 2026 16:0527,717143,992,851134,739,0001,075,0002,113,536
6Aug 3, 2026 16:0528,131146,272,778136,574,0001,269,0002,113,536
7Aug 3, 2026 16:0528,272147,619,182137,280,0001,256,0002,113,536
8Aug 3, 2026 16:0528,447148,418,431138,125,0001,267,0002,113,536
9Aug 3, 2026 16:0530,101156,573,659146,237,0001,258,0002,113,536