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 listFeb 24, 2026 21:28wnwnScore: 4,409Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 21:284,38061,821,88635,342,0001,009,0002,535,424
2Feb 24, 2026 21:294,38555,960,65835,382,0001,010,0002,535,424
3Feb 24, 2026 21:294,39557,959,24635,468,0001,013,0002,494,464
4Feb 24, 2026 21:284,40970,032,21835,581,0001,016,0002,494,464
5Feb 24, 2026 21:294,41063,156,31835,590,0001,016,0002,535,424
6Feb 24, 2026 21:284,82764,667,10538,061,0002,003,0002,490,368