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 26, 2024 02:16Joad NacerJoad NacerScore: 168,875Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2024 02:16168,836850,143,714826,296,000999,0002,428,928
2Dec 26, 2024 02:16168,846851,954,229826,348,000999,0002,531,328
3Dec 26, 2024 02:16168,847849,076,240826,353,000999,0002,531,328
4Dec 26, 2024 02:16168,862854,483,790826,424,000999,0002,424,832
5Dec 26, 2024 02:16168,875850,356,658826,488,000999,0002,269,184
6Dec 26, 2024 02:16168,889853,594,383825,559,0001,998,0002,269,184
7Dec 26, 2024 02:16168,896853,398,533826,590,000999,0002,269,184
8Dec 26, 2024 02:16168,947851,105,635825,840,0001,999,0002,424,832
9Dec 26, 2024 02:16168,967852,010,350826,939,000999,0002,269,184