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 listJul 22, 2022 00:45Robert BurkeRobert BurkeScore: 69,960Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2022 00:4567,991394,369,013333,155,78402,285,568
2Jul 22, 2022 00:4568,032391,253,540333,359,05102,285,568
3Jul 22, 2022 00:4568,048389,396,379333,434,78902,293,760
4Jul 22, 2022 00:4569,904364,884,888341,533,000998,0002,428,928
5Jul 22, 2022 00:4569,939364,903,500342,700,00002,281,472
6Jul 22, 2022 00:4569,957365,713,733341,792,000999,0002,433,024
7Jul 22, 2022 00:4569,960367,225,080341,803,000999,0002,281,472
8Jul 22, 2022 00:4569,961365,679,879341,810,000999,0002,281,472
9Jul 22, 2022 00:4569,983364,010,403341,917,000999,0002,428,928
10Jul 22, 2022 00:4570,005370,804,145342,026,0001,000,0002,277,376
11Jul 22, 2022 00:4570,027367,258,670342,130,0001,000,0002,424,832
12Jul 22, 2022 00:4570,078368,561,507342,383,000998,0002,424,832