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 listMar 24, 2024 01:51IhebIhebScore: 540,974Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 24, 2024 00:16540,9542,711,950,4832,650,674,60002,265,088
2Mar 24, 2024 01:51540,9632,716,301,1022,650,720,89902,256,896
3Mar 24, 2024 00:16540,9732,714,695,2282,650,768,11202,240,512
4Mar 24, 2024 01:51540,9742,725,734,3032,650,772,47302,260,992
5Mar 24, 2024 01:51540,9762,719,624,9632,650,782,20402,256,896
6Mar 24, 2024 00:16540,9972,716,264,6552,650,887,29702,244,608