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 29, 2024 03:24Joad NacerJoad NacerScore: 127,987Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2024 03:24127,408651,752,519624,301,00002,531,328
2Dec 29, 2024 03:24127,715646,942,595623,804,0001,999,0002,531,328
3Dec 29, 2024 03:24127,792651,867,153626,180,00002,269,184
4Dec 29, 2024 03:24127,929654,801,204624,852,0001,999,0002,531,328
5Dec 29, 2024 03:24127,987650,355,226627,138,00002,428,928
6Dec 29, 2024 03:24128,049658,680,410625,444,0001,998,0002,424,832
7Dec 29, 2024 03:24128,096651,498,847626,672,000999,0002,269,184
8Dec 29, 2024 03:24128,103653,672,173626,705,000999,0002,269,184
9Dec 29, 2024 03:24128,256665,505,254628,455,00002,424,832