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 18, 2026 19:43wnwnScore: 7,083Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 18, 2026 19:436,17878,743,25148,260,0003,016,0002,469,888
2Feb 18, 2026 19:436,20675,620,00549,487,0002,019,0002,285,568
3Feb 18, 2026 19:436,30174,610,89848,274,0004,022,0002,433,024
4Feb 18, 2026 19:437,06282,112,03155,585,0003,031,0002,420,736
5Feb 18, 2026 19:417,08388,292,86356,797,0001,992,0002,342,912
6Feb 18, 2026 19:417,08583,172,44357,809,000996,0002,424,832
7Feb 18, 2026 19:437,08584,160,67054,819,0003,986,0002,367,488
8Feb 18, 2026 19:417,16182,811,94456,415,0003,022,0002,457,600
9Feb 18, 2026 19:437,21185,957,65154,861,0004,987,0002,387,968