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 17, 2025 14:38Павел РатмановПавел РатмановScore: 332,857Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 17, 2025 14:38332,7831,655,062,5411,628,637,0001,998,0002,273,280
2Jun 17, 2025 14:38332,8341,653,252,6341,628,887,0001,998,0002,273,280
3Jun 17, 2025 14:38332,8361,653,986,0701,628,898,0001,998,0002,273,280
4Jun 17, 2025 14:38332,8571,657,758,6161,628,999,0001,998,0002,273,280
5Jun 17, 2025 14:38332,8571,653,660,4501,629,000,0001,998,0002,400,256
6Jun 17, 2025 14:38332,8691,659,250,9111,629,058,0001,998,0002,273,280
7Jun 17, 2025 14:38332,8711,658,130,8731,630,068,000999,0002,273,280
8Jun 17, 2025 14:38332,9181,656,436,2791,629,300,0001,999,0002,404,352
9Jun 17, 2025 14:38332,9201,654,272,2921,630,311,000999,0002,273,280