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 21, 2021 11:21Sergey StreminSergey StreminScore: 271,107Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 21, 2021 11:21206,5841,098,011,4691,012,260,78902,203,648
2May 21, 2021 11:21206,5861,068,334,0231,012,271,03402,199,552
3May 21, 2021 11:21206,6261,089,144,9941,012,468,04702,207,744
4May 21, 2021 11:21271,1071,399,913,1411,328,422,86802,207,744
5May 21, 2021 11:21271,3401,404,385,4601,329,566,14702,199,552
6May 21, 2021 11:21271,3461,391,738,8871,329,594,59502,199,552