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:33Josu San MartinJosu San MartinScore: 169,093Success
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:47168,989849,979,426828,044,00002,289,664
2Jan 16, 2026 22:47169,015854,103,397828,174,00002,289,664
3Jan 16, 2026 22:47169,084854,158,599826,515,0001,998,0002,289,664
4Jan 16, 2026 22:33169,093856,703,858827,557,000999,0002,289,664
5Jan 16, 2026 22:33169,204861,067,537828,101,0001,000,0002,359,296
6Jan 16, 2026 22:33169,269857,243,548827,422,0001,998,0002,289,664