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 19:02Tomislav TunkovicTomislav TunkovicScore: 404,290Success
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 19:04399,7081,966,820,3041,957,573,0001,000,0002,121,728stderr
2Aug 13, 2026 19:04399,8881,967,750,6291,958,454,0001,002,0002,121,728stderr
3Aug 13, 2026 19:04400,8931,972,666,3141,963,338,0001,041,0002,121,728stderr
4Aug 13, 2026 19:04403,3431,985,066,1061,975,377,0001,006,0002,121,728stderr
5Aug 13, 2026 19:04404,2901,990,285,3011,980,017,0001,004,0002,121,728stderr
6Aug 13, 2026 19:04404,6401,991,392,0861,981,734,0001,004,0002,121,728stderr
7Aug 13, 2026 19:04405,3071,994,239,0851,985,006,0001,003,0002,121,728stderr
8Aug 13, 2026 19:04407,5172,005,336,6751,995,834,0001,004,0002,121,728stderr
9Aug 13, 2026 19:04407,8232,006,925,9021,997,328,0001,005,0002,121,728stderr