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 4, 2021 18:17Ivan PodogovIvan PodogovScore: 1,431,316Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 4, 2021 18:171,326,4976,574,240,0656,499,836,01002,260,992
2May 4, 2021 18:171,327,6926,566,473,2506,505,689,48802,265,088
3May 4, 2021 18:171,328,7496,577,156,5456,510,870,72802,256,896
4May 4, 2021 18:171,431,3167,067,137,8597,013,449,13402,248,704
5May 4, 2021 18:171,431,6277,086,662,9107,014,971,68102,252,800
6May 4, 2021 18:171,432,0797,076,003,4317,017,185,46602,248,704