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:56Advait IyerAdvait IyerScore: 1,101,891Success
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:561,101,0305,426,021,0685,256,125,000138,924,0002,281,472
2Jan 10, 2025 14:561,101,8915,433,880,2325,271,357,000127,911,0002,281,472
3Jan 10, 2025 14:561,102,1915,430,384,9655,275,790,000124,947,0002,281,472