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 listAug 24, 2026 19:01Victor MerckléVictor MerckléScore: 28,510Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 24, 2026 19:0228,376147,358,763138,034,0001,010,0002,117,632stderr
2Aug 24, 2026 19:0228,386147,514,698137,070,0002,024,0002,117,632stderr
3Aug 24, 2026 19:0228,435147,790,541137,318,0002,015,0002,117,632stderr
4Aug 24, 2026 19:0228,510147,804,667138,690,0001,009,0002,117,632stderr
5Aug 24, 2026 19:0228,510148,119,843138,692,0001,011,0002,117,632stderr
6Aug 24, 2026 19:0228,585148,501,339139,060,0001,009,0002,117,632stderr
7Aug 24, 2026 19:0228,679148,939,395139,517,0001,011,0002,117,632stderr
8Aug 24, 2026 19:0228,689150,193,990138,563,0002,014,0002,117,632stderr
9Aug 24, 2026 19:0228,821149,639,139140,214,0001,013,0002,117,632stderr