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 listOct 29, 2025 22:46Alexander KovalyovAlexander KovalyovScore: 52,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 29, 2025 22:4652,540457,254,210434,085,0002,000,0002,277,376
2Oct 29, 2025 22:4652,545457,141,578434,121,0002,000,0002,277,376
3Oct 29, 2025 22:4652,559463,936,104433,242,0003,001,0002,265,088
4Oct 29, 2025 22:4652,572466,569,743435,344,0001,000,0002,277,376
5Oct 29, 2025 22:4652,573457,329,764436,360,00002,285,568
6Oct 29, 2025 22:4652,575458,649,370435,372,0001,000,0002,383,872
7Oct 29, 2025 22:4652,590466,191,936434,496,0001,997,0002,277,376
8Oct 29, 2025 22:4652,593467,479,755434,521,0001,997,0002,265,088
9Oct 29, 2025 22:4652,608465,812,621435,648,000999,0002,277,376