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 24, 2026 17:50Karthik ReddyKarthik ReddyScore: 75,785Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 24, 2026 17:5175,612637,853,307568,960,00058,623,0002,113,536
2Sep 24, 2026 17:5175,700639,744,315568,980,00059,336,0002,113,536
3Sep 24, 2026 17:5175,769639,172,914570,700,00058,190,0002,113,536
4Sep 24, 2026 17:5175,776639,165,760569,387,00059,556,0002,113,536
5Sep 24, 2026 17:5175,785639,305,539570,333,00058,687,0002,113,536
6Sep 24, 2026 17:5175,785639,323,761570,172,00058,844,0002,113,536
7Sep 24, 2026 17:5175,799639,378,474570,206,00058,933,0002,113,536
8Sep 24, 2026 17:5175,859639,890,962570,415,00059,216,0002,113,536
9Sep 24, 2026 17:5175,903643,337,395570,377,00059,626,0002,113,536