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 11, 2025 16:05Advait IyerAdvait IyerError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 16:0200000Error: expected "560377514875 ", got "560377514102 "
2Jan 11, 2025 15:17672,7383,325,521,7643,293,419,0002,998,0002,330,624
3Jan 11, 2025 15:17672,7743,330,193,0383,294,592,0001,999,0002,523,136
4Jan 11, 2025 16:05672,7833,333,091,2433,293,638,0002,997,0002,523,136
5Jan 11, 2025 15:17672,7973,325,424,0373,294,705,0001,998,0002,437,120
6Jan 11, 2025 16:05672,8323,324,779,9973,293,880,0002,998,0002,408,448
7Jan 11, 2025 16:05673,0693,329,498,7903,297,040,000999,0002,367,488