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 listDec 9, 2021 08:03Yuriy LyfenkoYuriy LyfenkoScore: 100,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2021 08:0399,745544,354,862488,751,66002,207,744
2Dec 9, 2021 08:0399,767548,533,363488,857,65602,215,936
3Dec 9, 2021 08:0399,804559,136,960489,041,59302,322,432
4Dec 9, 2021 08:03100,155511,190,886489,760,000999,0002,338,816
5Dec 9, 2021 08:03100,160516,559,912489,786,000999,0002,330,624
6Dec 9, 2021 08:03100,174521,747,067488,854,0001,999,0002,527,232
7Dec 9, 2021 08:03100,174513,659,221489,855,000999,0002,527,232
8Dec 9, 2021 08:03100,194515,756,486489,954,000999,0002,342,912
9Dec 9, 2021 08:03100,223518,840,792490,091,0001,000,0002,338,816
10Dec 9, 2021 08:03100,243517,487,835490,192,0001,000,0002,342,912
11Dec 9, 2021 08:03100,246515,635,790490,203,0001,000,0002,265,088
12Dec 9, 2021 08:03100,304520,991,356489,493,0001,997,0002,347,008