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 14:51Advait IyerAdvait IyerScore: 1,058,853Success
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 14:511,058,1575,215,525,2635,059,044,000125,926,0002,281,472
2Jan 10, 2025 14:511,058,8535,216,635,4815,040,484,000147,896,0002,293,760
3Jan 10, 2025 14:511,059,7175,217,656,2555,060,674,000131,939,0002,510,848