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 3, 2026 21:08anboto1anboto1Score: 57,660Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 3, 2026 21:0957,563291,056,012280,978,0001,083,0002,113,536
2Aug 3, 2026 21:0957,588291,203,328281,087,0001,095,0002,113,536
3Aug 3, 2026 21:0957,608290,794,891281,151,0001,129,0002,113,536
4Aug 3, 2026 21:0957,654291,560,005281,262,0001,246,0002,113,536
5Aug 3, 2026 21:0957,660291,584,488281,437,0001,100,0002,113,536
6Aug 3, 2026 21:0957,705291,201,676281,646,0001,112,0002,113,536
7Aug 3, 2026 21:0957,755292,087,634281,913,0001,091,0002,113,536
8Aug 3, 2026 21:0958,068293,001,068283,427,0001,111,0002,113,536
9Aug 3, 2026 21:0958,632296,450,943286,207,0001,094,0002,113,536