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 listAug 2, 2024 13:00BenBenScore: 565,294Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 2, 2024 13:07564,9652,829,251,1312,768,329,62702,248,704
2Aug 2, 2024 13:07565,1302,837,843,0702,769,136,12202,252,800
3Aug 2, 2024 13:00565,2922,835,686,0712,769,928,98002,256,896
4Aug 2, 2024 13:07565,2942,820,878,6292,769,941,16502,260,992
5Aug 2, 2024 13:00565,3382,831,709,1352,770,158,00602,248,704
6Aug 2, 2024 13:00565,3622,834,757,8012,770,275,48202,265,088