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 23, 2025 20:40caandocaandoScore: 6,276Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 23, 2025 20:406,14373,336,08349,992,000999,0002,523,136
2Oct 23, 2025 20:406,15673,623,40349,094,0002,003,0002,523,136
3Oct 23, 2025 20:406,15972,861,52849,118,0002,004,0002,269,184
4Oct 23, 2025 20:406,27673,383,59050,088,0002,003,0002,371,584
5Oct 23, 2025 20:406,27972,544,39550,111,0002,004,0002,523,136
6Oct 23, 2025 20:406,30274,622,82150,299,0002,011,0002,289,664