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 28, 2026 23:44Josu San MartinJosu San MartinScore: 25,367Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 28, 2026 23:4525,351132,629,637122,978,0001,244,0002,113,536
2Aug 28, 2026 23:4525,362132,696,237123,007,0001,269,0002,113,536
3Aug 28, 2026 23:4525,363132,627,847123,003,0001,277,0002,113,536
4Aug 28, 2026 23:4525,366133,348,733123,040,0001,258,0002,113,536
5Aug 28, 2026 23:4525,367133,254,819123,028,0001,272,0002,113,536
6Aug 28, 2026 23:4525,372133,327,444123,307,0001,016,0002,113,536
7Aug 28, 2026 23:4525,678134,232,522124,556,0001,271,0002,113,536
8Aug 28, 2026 23:4525,753134,654,814124,928,0001,263,0002,113,536
9Aug 28, 2026 23:4525,819134,933,902125,257,0001,260,0002,113,536