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 listMay 31, 2025 02:51Andrew AshworthAndrew AshworthScore: 69,357Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 31, 2025 02:5169,286600,290,156573,072,0002,000,0002,285,568
2May 31, 2025 02:5169,314601,519,361575,308,00002,277,376
3May 31, 2025 02:5169,317601,914,371574,330,0001,000,0002,269,184
4May 31, 2025 02:5169,352604,801,440573,625,0001,998,0002,260,992
5May 31, 2025 02:5169,357600,903,668573,668,0001,998,0002,285,568
6May 31, 2025 02:5169,383599,560,301574,878,000999,0002,285,568
7May 31, 2025 02:5169,405603,589,706575,060,0001,000,0002,285,568
8May 31, 2025 02:5169,409596,461,993576,092,00002,285,568
9May 31, 2025 02:5169,479599,423,766574,681,0001,998,0002,285,568