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:28Sergey StreminSergey StreminScore: 500,726Success
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:28432,9662,189,033,0462,121,531,37802,203,648
2May 10, 2021 21:28433,7842,187,498,6212,125,539,37502,195,456
3May 10, 2021 21:28433,8592,175,331,4252,125,911,43702,195,456
4May 10, 2021 21:28500,7262,515,389,6112,453,558,12002,203,648
5May 10, 2021 21:28500,9582,520,657,8922,454,696,24502,195,456
6May 10, 2021 21:28501,6012,520,866,6412,457,846,98002,195,456