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 10, 2025 15:17Advait IyerAdvait IyerScore: 1,016,899Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 10, 2025 15:171,015,9655,011,588,0244,975,229,0002,998,0002,285,568
2Jan 10, 2025 15:171,016,0755,008,483,1374,975,771,0002,998,0002,289,664
3Jan 10, 2025 15:171,016,0845,012,330,3534,975,813,0002,998,0002,285,568
4Jan 10, 2025 15:171,016,6115,011,325,0924,978,397,0002,997,0002,281,472
5Jan 10, 2025 15:171,016,8995,015,364,0774,976,808,0005,997,0002,289,664
6Jan 10, 2025 15:171,016,9515,011,383,6804,981,062,0001,999,0002,285,568
7Jan 10, 2025 15:171,016,9965,017,380,2074,981,282,0001,998,0002,281,472
8Jan 10, 2025 15:171,017,2115,015,899,4664,982,334,0001,998,0002,293,760
9Jan 10, 2025 15:171,017,8135,018,091,2974,984,288,0002,998,0002,293,760