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 20, 2021 06:43Sergey StreminSergey StreminScore: 274,481Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2021 06:43200,4701,045,732,351982,303,68202,199,552
2May 20, 2021 06:43200,4731,043,718,488982,316,43602,191,360
3May 20, 2021 06:43200,4731,040,621,149982,315,52002,207,744
4May 20, 2021 06:43274,4811,412,796,1701,344,954,69102,207,744
5May 20, 2021 06:43274,5021,413,770,1651,345,058,71402,187,264
6May 20, 2021 06:43274,5071,405,440,1531,345,086,03302,191,360