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 9, 2025 06:38Chaitanya GargChaitanya GargScore: 2,067,672Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 06:382,066,77017,191,430,14117,073,237,00080,958,0002,285,568
2Dec 9, 2025 06:382,066,79117,190,067,07317,094,397,00059,969,0002,519,040
3Dec 9, 2025 06:382,067,24517,192,927,25717,081,169,00076,964,0002,289,664
4Dec 9, 2025 06:382,067,66117,193,446,57917,089,621,00071,968,0002,277,376
5Dec 9, 2025 06:382,067,67217,194,810,70117,093,705,00067,970,0002,265,088
6Dec 9, 2025 06:382,067,73317,193,071,88817,089,215,00072,966,0002,289,664
7Dec 9, 2025 06:382,067,88317,201,723,70417,085,461,00077,970,0002,285,568
8Dec 9, 2025 06:382,070,80117,220,628,00417,112,687,00074,963,0002,277,376
9Dec 9, 2025 06:382,073,34117,243,329,52617,136,762,00071,969,0002,277,376