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 listSep 5, 2024 04:11matsuoka-601matsuoka-601Score: 59,844Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 5, 2024 04:1356,707299,534,063275,864,0001,999,0002,281,472
2Sep 5, 2024 04:1157,897309,880,102281,696,0001,997,0002,281,472
3Sep 5, 2024 04:1358,712318,704,844286,689,000998,0002,326,528
4Sep 5, 2024 04:1359,844322,961,486292,237,0001,000,0002,338,816
5Sep 5, 2024 04:1169,451367,021,005339,310,0001,000,0002,281,472
6Sep 5, 2024 04:1170,782368,877,382344,833,0001,999,0002,334,720