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 listSep 20, 2025 08:25sheryllynn24sheryllynn24Score: 10,402Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 20, 2025 08:2510,381110,947,07884,162,0002,003,0002,523,136
2Sep 20, 2025 08:2510,384116,119,49084,181,0002,004,0002,285,568
3Sep 20, 2025 08:2510,393111,590,98184,254,0002,006,0002,285,568
4Sep 20, 2025 08:2510,394109,659,36584,262,0002,006,0002,269,184
5Sep 20, 2025 08:2510,398110,628,30784,294,0002,007,0002,265,088
6Sep 20, 2025 08:2510,402111,431,56885,332,0001,003,0002,285,568
7Sep 20, 2025 08:2510,402116,684,85084,333,0002,007,0002,285,568
8Sep 20, 2025 08:2510,409109,265,88785,387,0001,004,0002,285,568
9Sep 20, 2025 08:2510,410116,614,17784,390,0002,009,0002,285,568
10Sep 20, 2025 08:2510,508115,571,46686,217,0001,002,0002,510,848
11Sep 20, 2025 08:2510,520121,456,33286,312,0001,003,0002,519,040
12Sep 20, 2025 08:2510,576114,209,28785,786,0001,995,0002,265,088