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 16, 2026 22:25Josu San MartinJosu San MartinScore: 165,338Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 16, 2026 22:25162,048823,167,955791,038,0002,996,0002,281,472
2Jan 16, 2026 22:25162,073820,754,637790,162,0003,995,0002,289,664
3Jan 16, 2026 22:25164,391829,830,316802,519,0002,998,0002,281,472
4Jan 16, 2026 22:25165,004838,951,000803,521,0004,997,0002,281,472
5Jan 16, 2026 22:25165,338844,068,831807,159,0002,996,0002,281,472
6Jan 16, 2026 22:25166,723848,041,118813,948,0002,996,0002,281,472
7Jan 16, 2026 22:25167,132847,008,613812,956,0005,992,0002,277,376
8Jan 16, 2026 22:25173,340880,147,068844,368,0004,996,0002,269,184
9Jan 16, 2026 22:25173,638877,967,480847,833,0002,995,0002,281,472