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 10:43Advait IyerAdvait IyerScore: 720,121Success
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 10:43719,9943,561,552,8283,524,973,0002,998,0002,293,760
2Jan 11, 2025 10:43720,0423,556,740,7553,525,210,0002,998,0002,510,848
3Jan 11, 2025 10:43720,0733,556,832,4993,525,358,0002,998,0002,293,760
4Jan 11, 2025 10:43720,1203,564,521,2063,525,592,0002,997,0002,293,760
5Jan 11, 2025 10:43720,1213,563,228,6493,526,595,0001,998,0002,293,760
6Jan 11, 2025 10:43720,1293,557,322,3433,525,635,0002,997,0002,293,760
7Jan 11, 2025 10:43720,1573,555,916,8823,526,769,0001,998,0002,293,760
8Jan 11, 2025 10:43720,1873,557,861,7103,527,917,000999,0002,506,752
9Jan 11, 2025 10:43720,2043,560,559,4393,526,001,0002,998,0002,506,752