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 listOct 25, 2021 16:35evgenikwtevgenikwtScore: 172,853Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2021 01:55171,752896,042,559841,586,12302,244,608
2Oct 25, 2021 01:55171,796895,657,144841,802,73102,244,608
3Oct 25, 2021 01:55172,015911,632,316842,873,57402,236,416
4Oct 25, 2021 16:35172,853914,205,187846,977,66402,244,608
5Oct 25, 2021 16:35173,127934,788,026848,322,43802,244,608
6Oct 25, 2021 16:35173,957938,882,945852,390,60102,244,608