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:23Sergey StreminSergey StreminScore: 275,307Success
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:23206,1701,076,080,1201,010,235,11702,187,264
2May 21, 2021 11:23206,2711,074,522,9901,010,728,38902,203,648
3May 21, 2021 11:23206,3761,083,577,9191,011,241,21202,191,360
4May 21, 2021 11:23275,3071,408,589,4191,349,002,46402,195,456
5May 21, 2021 11:23275,7811,415,918,0301,351,328,85102,199,552
6May 21, 2021 11:23275,8681,422,382,0881,351,755,15602,187,264