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 04:41anboto1anboto1Score: 59,045Success
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 04:4158,832298,271,865287,179,0001,102,0002,113,536
2Aug 3, 2026 04:4158,853299,220,038287,270,0001,113,0002,113,536
3Aug 3, 2026 04:4158,887299,305,259287,426,0001,124,0002,113,536
4Aug 3, 2026 04:4159,036299,394,387288,165,0001,116,0002,113,536
5Aug 3, 2026 04:4159,045299,529,635288,200,0001,122,0002,113,536
6Aug 3, 2026 04:4159,093300,417,476288,289,0001,269,0002,113,536
7Aug 3, 2026 04:4159,159300,826,022288,761,0001,121,0002,113,536
8Aug 3, 2026 04:4161,008309,147,244297,832,0001,109,0002,113,536
9Aug 3, 2026 04:4161,035309,812,619297,961,0001,114,0002,113,536