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 listApr 20, 2024 15:33Hal FHal FScore: 379,527Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 20, 2024 15:49379,3131,919,059,2901,858,632,28702,277,376
2Apr 20, 2024 15:49379,3971,938,465,9031,859,042,99002,277,376
3Apr 20, 2024 15:33379,4961,921,268,6571,859,529,98402,277,376
4Apr 20, 2024 15:33379,5271,924,411,2671,859,682,45602,269,184
5Apr 20, 2024 15:49379,5491,925,299,4111,859,791,53002,273,280
6Apr 20, 2024 15:33379,8201,919,938,4501,861,116,07402,281,472