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:34Sergey StreminSergey StreminScore: 382,958Success
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:34288,1291,483,608,8951,411,832,61002,187,264
2May 21, 2021 11:34288,2811,486,081,1691,412,576,92002,203,648
3May 21, 2021 11:34288,2951,472,142,7931,412,644,85802,191,360
4May 21, 2021 11:34382,9581,941,803,3971,876,496,04702,195,456
5May 21, 2021 11:34383,1601,940,362,0631,877,486,27002,191,360
6May 21, 2021 11:34383,4801,941,753,2521,879,053,62602,199,552