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 14:32Tomislav TunkovicTomislav TunkovicScore: 32,217Success
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 14:3331,847164,483,906155,039,0001,012,00020,480
2Aug 15, 2026 14:3331,874164,687,238155,176,0001,011,00020,480
3Aug 15, 2026 14:3331,976165,154,448155,675,0001,012,00020,480
4Aug 15, 2026 14:3332,124165,867,465156,401,0001,010,00020,480
5Aug 15, 2026 14:3332,217166,326,587156,850,0001,015,00020,480
6Aug 15, 2026 14:3332,623168,385,277158,846,0001,010,00020,480
7Aug 15, 2026 14:3332,902169,688,591159,210,0002,010,00020,480
8Aug 15, 2026 14:3333,116170,757,491161,261,0001,012,00020,480
9Aug 15, 2026 14:3336,336186,543,660177,044,0001,006,00020,480