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 listDec 26, 2024 02:24Joad NacerJoad NacerScore: 166,596Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 02:24166,559843,166,359816,141,00002,531,328
2Dec 26, 2024 02:24166,563846,522,049816,158,00002,531,328
3Dec 26, 2024 02:24166,585843,728,094815,268,000999,0002,269,184
4Dec 26, 2024 02:24166,590836,122,152815,294,000999,0002,424,832
5Dec 26, 2024 02:24166,596843,755,254815,322,000999,0002,531,328
6Dec 26, 2024 02:24166,617845,147,637815,425,000999,0002,531,328
7Dec 26, 2024 02:24166,649841,160,950814,584,0001,998,0002,428,928
8Dec 26, 2024 02:24166,662841,008,283815,644,000999,0002,531,328
9Dec 26, 2024 02:24171,368858,962,091838,702,000999,0002,269,184