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 24, 2021 08:39alex3dalex3dScore: 642,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 24, 2021 08:39595,3932,974,287,8572,917,425,28302,273,280
2May 24, 2021 08:39595,6502,981,012,3922,918,686,57802,277,376
3May 24, 2021 08:39596,2362,992,087,7522,921,557,20502,273,280
4May 24, 2021 08:39642,0023,199,492,0553,145,809,57502,273,280
5May 24, 2021 08:39642,6023,223,737,1533,148,748,57802,273,280
6May 24, 2021 08:39643,1943,218,453,3733,151,651,76202,273,280