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 listNov 10, 2024 08:08E SequeiraE SequeiraScore: 802,579Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 08:08786,3173,877,397,8853,849,955,0002,998,0002,285,568
2Nov 10, 2024 08:08802,2553,963,371,7603,927,054,0003,995,0002,297,856
3Nov 10, 2024 08:08802,5313,961,433,0773,930,404,0001,999,0002,285,568
4Nov 10, 2024 08:08802,5773,959,310,5643,929,627,0002,998,0002,519,040
5Nov 10, 2024 08:08802,5793,960,831,6993,929,637,0002,998,0002,285,568
6Nov 10, 2024 08:08802,6163,958,524,2223,930,818,0001,998,0002,285,568
7Nov 10, 2024 08:08802,7343,963,804,0153,930,401,0002,998,0002,285,568
8Nov 10, 2024 08:08802,7373,971,404,3583,930,413,0002,998,0002,293,760
9Nov 10, 2024 08:08802,8173,963,230,6083,931,804,0001,998,0002,285,568