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 listAug 13, 2025 17:42Andrija ZarićAndrija ZarićScore: 69,734Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 13, 2025 17:4269,192597,185,789573,290,0001,000,0002,359,296
2Aug 13, 2025 17:4269,363605,208,158573,711,0001,998,0002,285,568
3Aug 13, 2025 17:4269,592605,505,769575,613,0001,998,0002,465,792
4Aug 13, 2025 17:4269,704603,730,968577,545,000999,0002,281,472
5Aug 13, 2025 17:4269,734606,837,050576,797,0001,999,0002,285,568
6Aug 13, 2025 17:4269,740610,089,188576,844,0001,999,0002,285,568
7Aug 13, 2025 17:4269,741610,895,647578,851,00002,285,568
8Aug 13, 2025 17:4269,783611,116,919578,197,0001,000,0002,363,392
9Aug 13, 2025 17:4269,973611,771,371578,778,0001,999,0002,363,392