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 19, 2026 03:22Josu San MartinJosu San MartinScore: 83,606Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 19, 2026 03:2283,580440,644,018407,545,0001,997,0002,400,256
2Feb 19, 2026 03:2283,589437,154,119406,588,0002,996,0002,404,352
3Feb 19, 2026 03:2283,593436,168,720408,608,000999,0002,273,280
4Feb 19, 2026 03:2283,602439,815,645406,652,0002,997,0002,396,160
5Feb 19, 2026 03:2283,606441,333,108408,668,000999,0002,396,160
6Feb 19, 2026 03:2283,606435,461,009405,664,0004,006,0002,273,280
7Feb 19, 2026 03:2283,614436,040,743407,709,0001,998,0002,273,280
8Feb 19, 2026 03:2283,637440,231,692407,824,0001,999,0002,273,280
9Feb 19, 2026 03:2283,647433,765,508404,872,0004,998,0002,392,064