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 listJul 15, 2025 20:36Safronov AlekseiSafronov AlekseiScore: 50,374Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 15, 2025 20:3650,320442,643,374415,661,0001,998,0002,277,376
2Jul 15, 2025 20:3650,358448,991,594415,972,0001,999,0002,277,376
3Jul 15, 2025 20:3650,359447,286,781414,978,0002,999,0002,277,376
4Jul 15, 2025 20:3650,360445,803,954416,987,000999,0002,277,376
5Jul 15, 2025 20:3650,374445,967,264416,108,0002,000,0002,285,568
6Jul 15, 2025 20:3650,382442,425,287417,174,0001,000,0002,273,280
7Jul 15, 2025 20:3650,385440,364,320416,197,0002,000,0002,289,664
8Jul 15, 2025 20:3650,408439,520,541417,388,0001,000,0002,273,280
9Jul 15, 2025 20:3650,504444,171,105416,182,0003,001,0002,277,376