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 2, 2026 15:04Josu San MartinJosu San MartinScore: 30,628Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2026 15:0430,428159,164,315147,963,0001,137,0002,113,536
2Aug 2, 2026 15:0430,431159,026,685147,996,0001,119,0002,113,536
3Aug 2, 2026 15:0430,434159,801,675148,019,0001,111,0002,113,536
4Aug 2, 2026 15:0430,448159,628,468148,073,0001,123,0002,113,536
5Aug 2, 2026 15:0430,628160,821,097148,967,0001,114,0002,113,536
6Aug 2, 2026 15:0430,694160,964,549149,274,0001,128,0002,113,536
7Aug 2, 2026 15:0430,732161,277,735149,475,0001,115,0002,113,536
8Aug 2, 2026 15:0431,895166,306,065155,141,0001,146,0002,113,536
9Aug 2, 2026 15:0438,637199,336,519188,228,0001,098,0002,113,536