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 listAug 9, 2025 13:17rishab-naharrishab-naharScore: 2,066,905Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 9, 2025 13:172,063,82617,167,993,06317,060,786,00068,970,0002,277,376
2Aug 9, 2025 13:172,064,94917,166,731,20417,078,100,00060,975,0002,277,376
3Aug 9, 2025 13:172,065,01517,174,255,31517,088,640,00050,981,0002,277,376
4Aug 9, 2025 13:172,066,02217,179,436,16317,071,017,00076,964,0002,260,992
5Aug 9, 2025 13:172,066,90517,197,151,17617,093,338,00061,972,0002,277,376
6Aug 9, 2025 13:172,066,91217,187,344,05917,083,405,00071,963,0002,285,568
7Aug 9, 2025 13:172,066,98217,192,234,50917,089,980,00065,969,0002,510,848
8Aug 9, 2025 13:172,067,38517,187,727,28417,099,322,00059,973,0002,277,376
9Aug 9, 2025 13:172,142,68517,816,161,33417,719,315,00064,971,0002,277,376