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 22:06Joad NacerJoad NacerScore: 144,852Success
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 22:06144,674734,722,274707,902,000999,0002,428,928
2Dec 29, 2024 22:06144,780731,586,698708,421,000999,0002,531,328
3Dec 29, 2024 22:06144,829735,910,635707,661,0001,999,0002,420,736
4Dec 29, 2024 22:06144,852729,894,133708,778,000999,0002,531,328
5Dec 29, 2024 22:06144,864729,279,292708,834,000999,0002,420,736
6Dec 29, 2024 22:06144,869731,235,944708,859,000999,0002,531,328