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 listFeb 20, 2026 23:17Aleksei ShahoikaAleksei ShahoikaScore: 250,318Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 20, 2026 23:17250,0811,251,486,0281,222,400,0002,998,0002,289,664
2Feb 20, 2026 23:17250,1111,249,113,9581,223,547,0001,999,0002,273,280
3Feb 20, 2026 23:17250,2281,250,283,7811,223,118,0002,997,0002,289,664
4Feb 20, 2026 23:17250,2461,251,318,2511,222,210,0003,997,0002,281,472
5Feb 20, 2026 23:17250,3181,255,357,6491,224,560,0001,999,0002,289,664
6Feb 20, 2026 23:17250,3761,261,194,3541,223,842,0002,999,0002,281,472
7Feb 20, 2026 23:17252,5201,263,763,6451,234,349,0002,998,0002,289,664
8Feb 20, 2026 23:17252,6811,268,279,2281,235,139,0002,997,0002,281,472
9Feb 20, 2026 23:17252,8011,265,646,8831,235,727,0002,999,0002,289,664