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 listJul 13, 2025 23:30zielajzielajScore: 40,448Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 13, 2025 23:3040,418227,674,288196,049,0002,000,0002,322,432
2Jul 13, 2025 23:3040,419219,222,984197,054,0001,000,0002,461,696
3Jul 13, 2025 23:3040,434226,264,239198,126,00002,318,336
4Jul 13, 2025 23:3040,446224,075,495198,184,00002,322,432
5Jul 13, 2025 23:3040,448221,629,085198,195,00002,326,528
6Jul 13, 2025 23:3040,530225,967,550197,599,000997,0002,318,336
7Jul 13, 2025 23:3041,204229,340,050200,899,000999,0002,334,720
8Jul 13, 2025 23:3041,211225,583,350200,936,000999,0002,449,408
9Jul 13, 2025 23:3041,224224,864,650200,999,000999,0002,310,144