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 00:11Josu San MartinJosu San MartinScore: 87,953Success
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 00:1186,611455,082,453422,393,0002,001,0002,514,944
2Feb 19, 2026 03:1786,760456,200,909423,125,0002,000,0002,281,472
3Feb 19, 2026 03:1787,329455,609,899425,915,0001,999,0002,281,472
4Feb 19, 2026 00:1187,953463,737,058427,969,0002,999,0002,514,944
5Feb 19, 2026 03:1788,008456,243,015430,238,0001,000,0002,281,472
6Feb 19, 2026 00:1189,930467,967,314438,659,0001,998,0002,514,944