Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listMar 13, 2026 03:31olliecrowolliecrowError
Source Code

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

Challenge History
DateChallengerCostTypeStatus
Apr 27, 2026 11:59wn68.53CustomSolution Broken
Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2026 11:59017,150,70401,217,000303,104Exit with code 1:
2Mar 13, 2026 03:312,38845,527,89218,774,0001,043,0002,289,664
3Mar 13, 2026 03:312,39449,789,74417,883,0001,987,0002,289,664
4Mar 13, 2026 03:312,39642,548,84417,899,0001,988,0002,289,664
5Mar 13, 2026 03:312,39945,422,92617,921,0001,991,0002,277,376
6Mar 13, 2026 03:312,39951,352,46518,915,000995,0002,277,376
7Mar 13, 2026 03:312,40042,849,21518,926,000996,0002,289,664
8Mar 13, 2026 03:312,40540,400,90518,965,000998,0002,293,760
9Mar 13, 2026 03:312,40643,456,62017,974,0001,997,0002,289,664
10Mar 13, 2026 03:312,41640,825,72718,047,0002,005,0002,281,472