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 listMay 23, 2021 20:53alex3dalex3dScore: 4,317,585Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 23, 2021 20:534,200,45820,641,643,96820,582,245,11402,277,376
2May 23, 2021 20:534,209,73920,696,084,45120,627,721,43902,273,280
3May 23, 2021 20:534,254,47820,904,261,29820,846,943,61702,273,280
4May 23, 2021 20:534,317,58521,220,131,61121,156,167,47402,265,088
5May 23, 2021 20:534,319,96121,231,250,63821,167,810,64602,273,280
6May 23, 2021 20:534,772,30523,443,860,11723,384,295,27102,273,280