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 28, 2025 00:55Ruoyu QiuRuoyu QiuScore: 75,589Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 28, 2025 00:5575,396654,183,339623,790,0001,999,0002,285,568
2Jul 28, 2025 00:5575,561648,792,203626,160,0001,000,0002,265,088
3Jul 28, 2025 00:5575,564655,937,967626,184,0001,000,0002,285,568
4Jul 28, 2025 00:5575,579654,972,935626,304,0001,000,0002,285,568
5Jul 28, 2025 00:5575,589652,949,962626,388,0001,000,0002,285,568
6Jul 28, 2025 00:5575,589659,568,155626,391,0001,000,0002,285,568
7Jul 28, 2025 00:5575,606654,381,952626,530,000999,0002,285,568
8Jul 28, 2025 00:5575,607656,601,667625,536,0001,998,0002,285,568
9Jul 28, 2025 00:5575,636654,739,520625,782,0001,999,0002,273,280