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 26, 2025 18:50HattonuriHattonuriScore: 2,067,975Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 26, 2025 18:502,061,34217,138,145,72617,029,170,00079,967,0002,269,184
2Dec 26, 2025 18:502,067,80317,203,857,55217,101,787,00060,977,0002,277,376
3Dec 26, 2025 18:502,067,83417,194,220,10017,108,046,00054,974,0002,289,664
4Dec 26, 2025 18:502,067,85017,193,322,14317,109,176,00053,975,0002,277,376
5Dec 26, 2025 18:502,067,97517,194,030,18417,100,217,00063,974,0002,277,376
6Dec 26, 2025 18:502,068,18517,203,542,78817,112,961,00052,978,0002,523,136
7Dec 26, 2025 18:502,068,25117,199,271,06617,104,509,00061,972,0002,277,376
8Dec 26, 2025 18:502,072,13517,228,607,10317,130,746,00067,975,0002,289,664
9Dec 26, 2025 18:502,241,12218,630,370,91118,537,336,00063,973,0002,277,376