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 15, 2025 16:40Aman | अमनAman | अमनScore: 2,021,077Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 16:402,020,23416,795,936,11816,712,967,00054,973,0002,277,376
2Dec 15, 2025 16:402,020,50016,805,699,53216,713,177,00056,976,0002,277,376
3Dec 15, 2025 16:402,021,00416,805,560,81916,714,356,00059,976,0002,277,376
4Dec 15, 2025 16:402,021,01716,803,315,72816,707,472,00066,969,0002,289,664
5Dec 15, 2025 16:402,021,07716,812,991,08916,707,976,00066,967,0002,277,376
6Dec 15, 2025 16:402,022,47316,816,982,01516,714,561,00071,967,0002,265,088
7Dec 15, 2025 16:402,025,83916,850,245,66916,741,498,00072,967,0002,277,376
8Dec 15, 2025 16:402,034,52116,921,621,53416,825,553,00060,969,0002,277,376
9Dec 15, 2025 16:402,035,92716,931,093,12116,831,217,00066,973,0002,260,992