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 02:55Joad NacerJoad NacerScore: 153,150Success
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 02:55152,960771,446,622748,507,000999,0002,424,832
2Dec 29, 2024 02:55153,018777,999,621749,789,00002,531,328
3Dec 29, 2024 02:55153,044770,983,187748,917,000999,0002,269,184
4Dec 29, 2024 02:55153,149777,093,626749,430,000999,0002,269,184
5Dec 29, 2024 02:55153,150781,058,362749,434,000999,0002,424,832
6Dec 29, 2024 02:55153,374773,613,128749,534,0001,998,0002,269,184
7Dec 29, 2024 02:55153,479777,064,134751,048,0001,000,0002,531,328
8Dec 29, 2024 02:55155,970790,256,881764,252,00002,420,736
9Dec 29, 2024 02:55157,075788,696,901767,668,0001,999,0002,269,184