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 listDec 29, 2025 09:25Aman | अमनAman | अमनScore: 75,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 29, 2025 09:2575,161648,798,436569,853,00053,986,0002,387,968
2Dec 29, 2025 09:2575,204646,192,660570,175,00054,016,0002,383,872
3Dec 29, 2025 09:2575,225648,101,989566,333,00058,034,0002,285,568
4Dec 29, 2025 09:2575,263651,490,376562,715,00061,968,0002,281,472
5Dec 29, 2025 09:2575,382652,530,546560,704,00064,965,0002,273,280
6Dec 29, 2025 09:2575,391649,419,983557,772,00067,972,0002,273,280
7Dec 29, 2025 09:2575,404655,274,146550,873,00074,982,0002,281,472
8Dec 29, 2025 09:2575,466654,718,938564,328,00062,036,0002,392,064
9Dec 29, 2025 09:2575,505655,152,807562,722,00063,968,0002,281,472