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 10, 2021 21:31Sergey StreminSergey StreminScore: 503,590Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 10, 2021 21:31436,1992,198,643,2242,137,376,99402,211,840
2May 10, 2021 21:31436,3552,195,742,9452,138,137,30302,207,744
3May 10, 2021 21:31436,7222,195,971,1132,139,938,57702,191,360
4May 10, 2021 21:31503,5902,534,257,4712,467,593,25302,203,648
5May 10, 2021 21:31503,9442,532,808,1682,469,326,09402,203,648
6May 10, 2021 21:31504,3452,538,204,0302,471,289,23102,199,552