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 20, 2025 17:30zielajzielajScore: 29,946Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2025 17:3029,567165,124,377143,877,000999,0002,453,504
2Jul 20, 2025 17:3029,587165,855,160140,977,0003,999,0002,293,760
3Jul 20, 2025 17:3029,588164,436,186142,983,0001,999,0002,310,144
4Jul 20, 2025 17:3029,603168,711,273142,053,0003,001,0002,326,528
5Jul 20, 2025 17:3029,946168,219,479145,737,000998,0002,310,144
6Jul 20, 2025 17:3030,141171,731,570147,690,00002,297,856
7Jul 20, 2025 17:3030,209170,597,643147,023,0001,000,0002,461,696
8Jul 20, 2025 17:3030,237167,348,611147,161,0001,001,0002,322,432
9Jul 20, 2025 17:3030,953184,239,780150,674,000997,0002,322,432