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 listDec 21, 2025 18:17Josu San MartinJosu San MartinScore: 856,911Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2025 18:17856,0284,225,296,4914,081,604,000112,933,0002,289,664
2Dec 21, 2025 18:17856,2514,222,481,0094,082,696,000112,936,0002,281,472
3Dec 21, 2025 18:17856,5314,229,029,1594,077,061,000119,942,0002,289,664
4Dec 21, 2025 18:17856,6974,229,176,4514,083,877,000113,940,0002,281,472
5Dec 21, 2025 18:17856,9114,228,109,4144,085,920,000112,942,0002,289,664
6Dec 21, 2025 18:17857,1664,223,985,1894,076,171,000123,944,0002,289,664
7Dec 21, 2025 18:17857,3694,234,618,4784,080,193,000120,916,0002,285,568
8Dec 21, 2025 18:17859,4904,237,521,8904,090,575,000120,928,0002,281,472
9Dec 21, 2025 18:17859,8694,241,704,8144,088,435,000124,921,0002,285,568