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 18, 2025 19:49Aniruddha DebAniruddha DebScore: 208,722Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 19:49206,4011,034,143,2401,010,368,000999,0002,531,328
2Aug 18, 2025 19:49207,0631,038,848,9171,013,610,000999,0002,531,328
3Aug 18, 2025 19:49207,4991,037,171,0841,014,744,0001,999,0002,424,832
4Aug 18, 2025 19:49207,9581,042,988,5501,017,995,000999,0002,531,328
5Aug 18, 2025 19:49208,7221,045,270,7641,021,738,000999,0002,531,328
6Aug 18, 2025 19:49209,6931,053,288,9901,025,496,0001,999,0002,269,184
7Aug 18, 2025 19:49210,5531,055,040,7001,030,712,000999,0002,269,184
8Aug 18, 2025 19:49214,9781,080,364,3971,052,394,000999,0002,420,736
9Aug 18, 2025 19:49215,6901,080,275,3561,056,882,00002,531,328