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 listJul 2, 2021 20:20Vitaliy F.Vitaliy F.Score: 785,385Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 2, 2021 19:29785,2963,911,852,8483,847,952,34302,273,280
2Jul 2, 2021 20:20785,3463,910,437,5523,848,193,80002,269,184
3Jul 2, 2021 19:29785,3483,916,204,1963,848,204,68002,269,184
4Jul 2, 2021 20:20785,3853,914,684,3303,848,385,57902,265,088
5Jul 2, 2021 19:29785,4593,913,387,7333,848,747,40302,281,472
6Jul 2, 2021 20:20785,5063,917,248,7243,848,981,69102,285,568