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 listNov 16, 2024 16:37Dan StolyarovDan StolyarovScore: 2,992,178Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 16:372,978,14514,627,101,20914,477,967,000114,944,0002,281,472
2Nov 16, 2024 16:372,992,17814,807,779,84514,517,889,000143,781,0002,281,472
3Nov 16, 2024 16:373,337,10616,386,662,96016,238,870,000112,950,0002,281,472