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 11:30Jatin GargJatin GargScore: 2,067,068Success
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 11:302,065,17617,172,793,33317,080,986,00059,975,0002,277,376
2Dec 8, 2025 11:302,066,15417,183,551,18917,072,115,00076,964,0002,277,376
3Dec 8, 2025 11:302,066,47017,182,429,58617,076,738,00074,963,0002,277,376
4Dec 8, 2025 11:302,066,91917,192,278,79917,094,460,00060,969,0002,260,992
5Dec 8, 2025 11:302,067,06817,192,089,46917,081,698,00074,967,0002,519,040
6Dec 8, 2025 11:302,068,36617,203,898,29217,091,472,00075,966,0002,277,376
7Dec 8, 2025 11:302,073,92817,245,287,78517,144,634,00068,970,0002,277,376
8Dec 8, 2025 11:302,074,71117,249,994,68017,144,138,00075,965,0002,277,376
9Dec 8, 2025 11:302,123,00017,653,401,61717,543,944,00076,960,0002,277,376