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 listApr 6, 2025 13:53Aniruddha DebAniruddha DebScore: 361,297Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 6, 2025 13:53361,2611,793,328,2191,769,180,000999,0002,269,184
2Apr 6, 2025 13:53361,2811,794,145,4961,768,279,0001,999,0002,269,184
3Apr 6, 2025 13:53361,2941,799,106,8261,769,341,000999,0002,424,832
4Apr 6, 2025 13:53361,2951,792,033,9981,769,346,000999,0002,420,736
5Apr 6, 2025 13:53361,2971,795,652,2671,769,357,000999,0002,424,832
6Apr 6, 2025 13:53361,3071,794,061,3431,770,406,00002,428,928
7Apr 6, 2025 13:53361,3111,790,301,3951,769,424,000999,0002,269,184
8Apr 6, 2025 13:53361,3121,798,786,5001,769,431,000999,0002,269,184
9Apr 6, 2025 13:53361,3181,794,145,0621,770,458,00002,428,928