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 listJul 31, 2026 17:34anboto1anboto1Score: 173,550Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 17:35173,389860,722,236848,460,0001,149,0002,113,536
2Jul 31, 2026 17:35173,412859,978,461848,577,0001,146,0002,113,536
3Jul 31, 2026 17:35173,500865,180,071848,996,0001,158,0002,113,536
4Jul 31, 2026 17:35173,500861,185,505848,998,0001,155,0002,113,536
5Jul 31, 2026 17:35173,550860,621,726849,264,0001,134,0002,113,536
6Jul 31, 2026 17:35173,713861,630,938850,046,0001,150,0002,113,536
7Jul 31, 2026 17:35173,760862,827,081850,282,0001,144,0002,113,536
8Jul 31, 2026 17:35173,822861,991,083850,586,0001,145,0002,113,536
9Jul 31, 2026 17:35174,384864,676,161853,347,0001,137,0002,113,536