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 04:14evgenikwtevgenikwtScore: 174,334Success
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 04:30174,290903,828,674854,019,03602,244,608
2Oct 25, 2021 04:33174,297910,017,037854,055,30702,240,512
3Oct 25, 2021 04:30174,302913,418,095854,077,38702,244,608
4Oct 25, 2021 04:14174,325911,277,295854,191,69302,244,608
5Oct 25, 2021 04:33174,334910,461,745854,236,48902,240,512
6Oct 25, 2021 04:30174,358923,169,688854,351,84302,244,608
7Oct 25, 2021 04:14174,385918,020,905854,488,66102,248,704
8Oct 25, 2021 04:33175,320937,065,190859,070,23402,240,512
9Oct 25, 2021 04:14175,454917,628,894859,726,40002,244,608