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 8, 2025 05:32shubhchhabrashubhchhabraScore: 2,066,477Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 05:322,063,75617,165,311,80117,067,201,00061,971,0002,367,488
2Dec 8, 2025 05:322,065,78317,178,167,28117,073,025,00072,970,0002,260,992
3Dec 8, 2025 05:322,066,06317,181,798,02917,088,349,00059,976,0002,289,664
4Dec 8, 2025 05:322,066,18317,184,188,99017,085,350,00063,971,0002,285,568
5Dec 8, 2025 05:322,066,47717,184,636,95017,082,788,00068,974,0002,277,376
6Dec 8, 2025 05:322,066,65917,189,073,25817,083,294,00069,972,0002,277,376
7Dec 8, 2025 05:322,068,04117,196,269,26017,085,781,00078,962,0002,277,376
8Dec 8, 2025 05:322,070,04217,207,774,04817,106,383,00074,966,0002,277,376
9Dec 8, 2025 05:322,090,97417,384,347,90817,261,129,00093,957,0002,277,376