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 listMay 14, 2026 14:51Pavel SkripkinPavel SkripkinScore: 205,850Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 14, 2026 14:52205,6421,016,746,9831,006,644,0001,003,0002,117,632
2May 14, 2026 14:52205,6741,015,187,7351,005,794,0002,012,0002,117,632
3May 14, 2026 14:52205,8191,016,041,8931,006,509,0002,008,0002,117,632
4May 14, 2026 14:52205,8321,016,051,0941,006,526,0002,053,0002,117,632
5May 14, 2026 14:52205,8501,018,997,8191,007,665,0001,002,0002,117,632
6May 14, 2026 14:52205,9481,016,521,2551,008,148,0001,002,0002,117,632
7May 14, 2026 14:52206,1671,020,926,2791,008,199,0002,021,0002,117,632
8May 14, 2026 14:52206,3831,020,732,9301,010,276,0001,002,0002,117,632
9May 14, 2026 14:52206,4641,021,039,8291,010,673,0001,004,0002,117,632