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 20, 2026 06:01M-RochatM-RochatScore: 11,821Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 20, 2026 06:0111,797108,583,24495,576,0002,340,0002,113,536
2May 20, 2026 06:0111,798109,756,65195,587,0002,339,0002,113,536
3May 20, 2026 06:0111,800109,545,06595,601,0002,340,0002,113,536
4May 20, 2026 06:0111,819107,800,50996,052,0002,052,0002,113,536
5May 20, 2026 06:0111,821108,430,57296,103,0002,015,0002,113,536
6May 20, 2026 06:0111,829107,965,62796,165,0002,022,0002,113,536
7May 20, 2026 06:0111,893110,065,90096,648,0002,069,0002,113,536
8May 20, 2026 06:0111,907109,442,18096,755,0002,081,0002,113,536
9May 20, 2026 06:0111,914111,307,69196,836,0002,058,0002,113,536