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 26, 2021 21:00Mikhail DektyarevMikhail DektyarevScore: 221,651Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 26, 2021 21:00218,6661,111,578,6601,071,463,05802,220,032
2May 26, 2021 20:46219,0681,123,848,3461,073,434,52902,236,416
3May 26, 2021 20:46219,7471,136,555,3471,076,761,79302,228,224
4May 26, 2021 21:00221,6511,128,143,4921,086,089,37802,228,224
5May 26, 2021 20:46222,8051,139,752,6741,091,742,07002,224,128
6May 26, 2021 21:00224,3291,158,936,5851,099,209,69402,228,224