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 13, 2026 15:17Tomislav TunkovicTomislav TunkovicScore: 57,324Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2026 15:1857,290289,128,564279,535,0001,189,0002,117,632
2Aug 13, 2026 15:1857,296289,172,049279,587,0001,165,0002,117,632
3Aug 13, 2026 15:1857,312289,229,512279,602,0001,227,0002,117,632
4Aug 13, 2026 15:1857,323289,384,307279,657,0001,230,0002,117,632
5Aug 13, 2026 15:1857,324289,486,584279,635,0001,255,0002,117,632
6Aug 13, 2026 15:1857,384289,783,464279,913,0001,271,0002,117,632
7Aug 13, 2026 15:1857,762291,617,241281,858,0001,179,0002,117,632
8Aug 13, 2026 15:1857,776291,666,396281,927,0001,176,0002,117,632
9Aug 13, 2026 15:1857,788291,574,036281,981,0001,185,0002,117,632