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 listNov 1, 2021 22:42evgenikwtevgenikwtScore: 174,280Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 1, 2021 22:42173,498910,932,347850,139,80102,211,840
2Nov 1, 2021 22:34173,727934,084,696851,262,90302,195,456
3Nov 1, 2021 22:34173,860937,462,466851,915,04802,203,648
4Nov 1, 2021 22:42174,280909,523,731853,971,90902,203,648
5Nov 1, 2021 22:34179,127944,156,905877,720,53502,207,744
6Nov 1, 2021 22:42179,543941,404,926879,759,38702,199,552