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 13, 2026 18:04M-RochatM-RochatScore: 19,620Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 13, 2026 18:0519,556172,425,727161,283,0001,035,0002,113,536
2May 13, 2026 18:0519,556171,803,049161,288,0001,029,0002,113,536
3May 13, 2026 18:0519,579173,311,734161,462,0001,050,0002,113,536
4May 13, 2026 18:0519,605171,460,033161,697,0001,030,0002,113,536
5May 13, 2026 18:0519,620173,118,497161,777,0001,069,0002,113,536
6May 13, 2026 18:0519,652171,790,543162,087,0001,031,0002,113,536
7May 13, 2026 18:0519,669174,347,684162,192,0001,068,0002,113,536
8May 13, 2026 18:0519,695173,984,651162,434,0001,040,0002,113,536
9May 13, 2026 18:0519,778174,838,793163,125,0001,034,0002,113,536