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 11, 2025 23:56zielajzielajScore: 52,665Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 11, 2025 23:5652,082279,391,557254,204,0001,000,0002,428,928
2Jul 11, 2025 23:5652,091276,133,953255,244,00002,478,080
3Jul 11, 2025 23:5652,096280,598,264254,269,0001,001,0002,428,928
4Jul 11, 2025 23:5652,173280,135,961254,649,000998,0002,424,832
5Jul 11, 2025 23:5652,665281,869,110257,057,0001,000,0002,433,024
6Jul 11, 2025 23:5652,680277,898,306258,134,00002,478,080
7Jul 11, 2025 23:5652,684284,351,904257,154,0001,000,0002,437,120
8Jul 11, 2025 23:5652,701281,966,377257,236,0001,000,0002,433,024
9Jul 11, 2025 23:5652,706289,534,396257,261,000997,0002,478,080