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 3, 2021 22:52Stanislav-PovolotskyStanislav-PovolotskyScore: 440,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 3, 2021 22:52407,7222,062,146,3361,997,835,41502,269,184
2May 3, 2021 22:52407,8742,063,747,7751,998,582,19202,273,280
3May 3, 2021 22:52408,0412,058,409,0961,999,399,80402,273,280
4May 3, 2021 22:52440,6652,216,271,1342,159,256,83602,269,184
5May 3, 2021 22:52440,7112,234,129,4712,159,485,27602,277,376
6May 3, 2021 22:52814,3534,044,183,2543,990,328,87402,265,088