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 20, 2023 11:08matsuoka-601matsuoka-601Score: 487,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 20, 2023 11:08486,9342,444,596,7172,385,975,83402,269,184
2Dec 20, 2023 11:06486,9552,448,457,1012,386,077,92202,277,376
3Dec 20, 2023 11:06486,9632,444,515,0982,386,120,61502,269,184
4Dec 20, 2023 11:06487,0022,445,199,2432,386,308,56002,273,280
5Dec 20, 2023 11:08487,0202,460,250,0872,386,399,21302,273,280
6Dec 20, 2023 11:08487,0472,442,924,5332,386,529,89702,269,184