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 listJan 21, 2026 18:47Josu San MartinJosu San MartinScore: 114,908Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 21, 2026 18:47114,769588,989,191558,365,0004,002,0002,281,472
2Jan 21, 2026 18:47114,801588,171,756558,529,0003,996,0002,297,856
3Jan 21, 2026 18:47114,807591,265,086560,554,0001,998,0002,461,696
4Jan 21, 2026 18:47114,896594,154,218557,990,0004,999,0002,297,856
5Jan 21, 2026 18:47114,908591,208,802557,049,0006,000,0002,281,472
6Jan 21, 2026 18:47115,247590,978,954559,713,0004,997,0002,281,472
7Jan 21, 2026 18:47115,269590,047,801561,819,0002,999,0002,281,472
8Jan 21, 2026 18:47115,294593,466,355558,940,0005,999,0002,281,472
9Jan 21, 2026 18:47115,779596,313,109561,313,0006,003,0002,281,472