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 9, 2021 19:13Sergey StreminSergey StreminScore: 509,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 9, 2021 19:13436,7892,200,906,7082,140,265,96902,203,648
2May 9, 2021 19:13436,9002,198,323,8812,140,810,51702,199,552
3May 9, 2021 19:13436,9812,202,209,2662,141,206,24802,203,648
4May 9, 2021 19:13509,2942,550,626,0462,495,540,23902,203,648
5May 9, 2021 19:13509,6972,566,534,9102,497,517,06202,199,552
6May 9, 2021 19:13509,8192,566,838,8052,498,114,64002,199,552