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 listJul 26, 2025 15:12Ruoyu QiuRuoyu QiuScore: 235,639Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 26, 2025 15:12235,3161,977,189,8931,793,196,000159,928,0002,351,104
2Jul 26, 2025 15:12235,5301,984,275,0131,765,007,000189,893,0002,301,952
3Jul 26, 2025 15:12235,5701,977,484,9261,769,306,000185,927,0002,260,992
4Jul 26, 2025 15:12235,5781,983,991,7261,769,367,000185,933,0002,314,240
5Jul 26, 2025 15:12235,6391,980,675,3271,762,921,000192,882,0002,351,104
6Jul 26, 2025 15:12235,8931,982,456,4231,760,021,000197,890,0002,306,048
7Jul 26, 2025 15:12236,1051,983,520,7721,754,812,000204,861,0002,424,832
8Jul 26, 2025 15:12236,2691,983,549,6001,771,124,000189,906,0002,342,912
9Jul 26, 2025 15:12260,5162,190,188,5501,965,351,000196,935,0002,314,240