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 listNov 5, 2025 10:58caandocaandoScore: 5,573Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 5, 2025 10:585,48672,230,49644,519,0001,011,0002,514,944
2Nov 5, 2025 10:585,53574,674,95643,941,0001,997,0002,285,568
3Nov 5, 2025 10:585,53769,800,50743,962,0001,998,0002,285,568
4Nov 5, 2025 10:585,53972,553,05043,972,0001,998,0002,273,280
5Nov 5, 2025 10:585,55167,744,49545,076,0001,001,0002,527,232
6Nov 5, 2025 10:585,56973,462,86044,217,0002,009,0002,285,568
7Nov 5, 2025 10:585,57366,423,45044,247,0002,011,0002,285,568
8Nov 5, 2025 10:585,57977,668,57945,303,0001,006,0002,269,184
9Nov 5, 2025 10:585,58167,505,65945,315,0001,007,0002,527,232
10Nov 5, 2025 10:585,64072,877,25144,823,0001,992,0002,285,568
11Nov 5, 2025 10:585,67371,856,12246,087,0001,001,0002,519,040
12Nov 5, 2025 10:585,67969,063,35945,133,0002,005,0002,285,568