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 26, 2025 19:23zielajzielajScore: 25,662Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2025 19:2325,643143,377,093122,660,0002,991,0002,486,272
2Jul 26, 2025 19:2325,646152,010,013123,673,0001,994,0002,322,432
3Jul 26, 2025 19:2325,656147,037,193123,718,0001,995,0002,326,528
4Jul 26, 2025 19:2325,656148,272,329124,717,000997,0002,478,080
5Jul 26, 2025 19:2325,662150,245,240121,755,0003,991,0002,347,008
6Jul 26, 2025 19:2325,665152,671,979124,759,000998,0002,322,432
7Jul 26, 2025 19:2326,067152,007,807126,732,000997,0002,306,048
8Jul 26, 2025 19:2327,380153,982,533133,163,0001,001,0002,318,336
9Jul 26, 2025 19:2327,615157,105,205134,312,0001,002,0002,486,272