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 30, 2025 23:58zielajzielajScore: 24,306Success
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 26, 2026 17:01Sergey Svistunov-RecheckSolution Held
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 30, 2025 23:5824,258139,147,228116,868,0001,997,0002,473,984
2Jul 30, 2025 23:5824,263142,796,486117,888,000999,0002,465,792
3Apr 26, 2026 17:0224,287132,734,060117,010,0002,000,0002,383,872stderr
4Apr 26, 2026 17:0224,306137,085,254118,102,0001,000,0002,449,408stderr
5Jul 30, 2025 23:5824,837154,575,680121,699,00002,330,624
6Apr 26, 2026 17:0225,464142,367,445122,778,0001,996,0002,437,120stderr