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:44Jatin GargJatin GargScore: 72,490Success
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:4472,478630,009,979601,564,00002,256,896
2Dec 8, 2025 11:4472,484627,951,122600,618,000999,0002,285,568
3Dec 8, 2025 11:4472,487628,943,086599,648,0001,998,0002,277,376
4Dec 8, 2025 11:4472,489632,363,882600,659,000999,0002,285,568
5Dec 8, 2025 11:4472,490630,918,202599,672,0001,998,0002,277,376
6Dec 8, 2025 11:4472,502631,700,212599,769,0001,999,0002,285,568
7Dec 8, 2025 11:4472,504630,094,839598,786,0002,998,0002,277,376
8Dec 8, 2025 11:4472,506631,425,691599,797,0001,999,0002,289,664
9Dec 8, 2025 11:4472,537624,650,549599,058,0003,000,0002,285,568