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 listJun 19, 2025 21:35Daniel NeumannDaniel NeumannScore: 726,599Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 19, 2025 21:35726,5323,584,190,8113,557,008,0002,998,0002,285,568
2Jun 19, 2025 21:35726,5413,587,478,8083,557,051,0002,998,0002,531,328
3Jun 19, 2025 21:35726,5673,588,193,3613,558,181,0001,998,0002,285,568
4Jun 19, 2025 21:35726,5813,587,873,1103,559,250,000999,0002,285,568
5Jun 19, 2025 21:35726,5993,590,531,2053,558,335,0001,999,0002,277,376
6Jun 19, 2025 21:35726,6213,585,542,5293,558,444,0001,999,0002,269,184
7Jun 19, 2025 21:35726,6543,590,055,0623,557,607,0002,997,0002,285,568
8Jun 19, 2025 21:35726,6773,589,651,1133,558,719,0001,999,0002,285,568
9Jun 19, 2025 21:35726,6783,593,065,1923,557,726,0002,998,0002,269,184