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 15, 2026 21:57Tomislav TunkovicTomislav TunkovicScore: 29,173Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 15, 2026 22:0629,000151,229,466141,094,0001,010,00020,480
2Aug 15, 2026 22:0629,017150,607,633141,173,0001,011,00020,480
3Aug 15, 2026 22:0629,026150,669,688141,222,0001,009,00020,480
4Aug 15, 2026 22:0629,054151,406,908141,360,0001,007,00020,480
5Aug 15, 2026 22:0629,173152,119,939141,944,0001,008,00020,480
6Aug 15, 2026 22:0629,375153,067,691142,934,0001,007,00020,480
7Aug 15, 2026 22:0629,523153,162,493143,654,0001,009,00020,480
8Aug 15, 2026 22:0629,583154,090,105143,954,0001,007,00020,480
9Aug 15, 2026 22:0630,879160,439,661150,297,0001,013,00020,480