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:00M-RochatM-RochatScore: 11,807Success
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,792109,447,94495,548,0002,328,0002,113,536
2May 20, 2026 06:0111,793107,352,89095,856,0002,034,0002,113,536
3May 20, 2026 06:0111,802109,454,92395,617,0002,344,0002,113,536
4May 20, 2026 06:0111,802107,313,28295,607,0002,350,0002,113,536
5May 20, 2026 06:0111,807110,175,57395,663,0002,340,0002,113,536
6May 20, 2026 06:0111,822107,430,21396,010,0002,118,0002,113,536
7May 20, 2026 06:0111,827108,530,16095,823,0002,349,0002,113,536
8May 20, 2026 06:0111,838122,708,62196,236,0002,021,0002,113,536
9May 20, 2026 06:0111,868109,867,25096,497,0002,011,0002,113,536