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 20:40anboto1anboto1Score: 57,682Success
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 20:4257,532290,388,229280,858,0001,052,0002,113,536
2Aug 3, 2026 20:4257,598290,796,450281,054,0001,181,0002,113,536
3Aug 3, 2026 20:4257,608290,710,710281,150,0001,131,0002,113,536
4Aug 3, 2026 20:4257,674291,056,544281,426,0001,179,0002,113,536
5Aug 3, 2026 20:4257,682291,063,437281,531,0001,112,0002,113,536
6Aug 3, 2026 20:4257,705291,215,653281,644,0001,111,0002,113,536
7Aug 3, 2026 20:4257,800292,025,228282,100,0001,124,0002,113,536
8Aug 3, 2026 20:4258,020292,800,457283,018,0001,282,0002,113,536
9Aug 3, 2026 20:4258,139293,084,749283,712,0001,173,0002,113,536