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:56Jatin GargJatin GargScore: 56,100Success
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:5656,049489,738,932464,204,0001,000,0002,285,568
2Dec 8, 2025 11:5656,078494,704,021465,448,00002,523,136
3Dec 8, 2025 11:5656,084487,678,482464,498,0001,001,0002,269,184
4Dec 8, 2025 11:5656,099488,827,934463,622,0001,998,0002,277,376
5Dec 8, 2025 11:5656,100492,017,015463,628,0001,998,0002,265,088
6Dec 8, 2025 11:5656,101492,610,955463,640,0001,998,0002,519,040
7Dec 8, 2025 11:5656,104493,225,968464,668,000999,0002,285,568
8Dec 8, 2025 11:5656,110494,960,492463,711,0001,998,0002,277,376
9Dec 8, 2025 11:5656,110491,159,917463,712,0001,998,0002,265,088