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:45Tomislav TunkovicTomislav TunkovicScore: 35,732Success
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:5535,430181,828,483172,521,0001,087,0002,117,632
2Aug 13, 2026 19:5535,566182,449,032173,184,0001,091,0002,117,632
3Aug 13, 2026 19:5535,655183,018,856173,545,0001,169,0002,117,632
4Aug 13, 2026 19:5535,705183,339,321173,858,0001,100,0002,117,632
5Aug 13, 2026 19:5535,732183,413,475174,002,0001,088,0002,117,632
6Aug 13, 2026 19:5535,962184,483,903175,106,0001,109,0002,117,632
7Aug 13, 2026 19:5536,322186,247,872176,891,0001,091,0002,117,632
8Aug 13, 2026 19:5536,668187,951,856178,504,0001,171,0002,117,632
9Aug 13, 2026 19:5537,295191,016,220181,666,0001,083,0002,117,632