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 05:31M-RochatM-RochatScore: 15,582Success
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 05:3115,520138,719,990126,605,0002,212,0002,117,632
2May 20, 2026 05:3115,535138,179,602126,732,0002,214,0002,113,536
3May 20, 2026 05:3115,544140,975,389126,803,0002,214,0002,113,536
4May 20, 2026 05:3115,568139,594,775125,972,0003,247,0002,113,536
5May 20, 2026 05:3115,582138,701,168126,118,0003,220,0002,113,536
6May 20, 2026 05:3115,604138,788,217127,312,0002,204,0002,113,536
7May 20, 2026 05:3115,646140,978,979127,640,0002,222,0002,113,536
8May 20, 2026 05:3115,659139,275,323126,741,0003,234,0002,113,536
9May 20, 2026 05:3115,679141,308,203126,934,0003,204,0002,113,536