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 listAug 16, 2025 13:37Ashish AhujaAshish AhujaScore: 19,945Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2025 13:3219,814187,019,166162,462,0001,993,0002,277,376
2Aug 16, 2025 13:3219,817190,860,402163,479,0001,002,0002,285,568
3Aug 16, 2025 13:2719,918187,342,819163,319,0002,003,0002,293,760
4Aug 16, 2025 13:2719,922192,368,650164,354,0001,002,0002,285,568
5Aug 16, 2025 13:5019,926186,666,020164,381,0001,002,0002,285,568
6Aug 16, 2025 13:5019,930194,144,217163,413,0002,005,0002,289,664
7Aug 16, 2025 13:5019,945196,839,140163,540,0002,006,0002,277,376
8Aug 16, 2025 13:3719,964194,595,947162,708,0002,994,0002,277,376
9Aug 16, 2025 13:2719,968195,130,365164,738,000998,0002,285,568
10Aug 16, 2025 13:3720,020192,752,830164,162,0002,001,0002,285,568
11Aug 16, 2025 13:3220,991198,567,473171,220,0003,003,0002,285,568
12Aug 16, 2025 13:3721,367204,761,359174,344,0003,005,0002,285,568