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:39M-RochatM-RochatScore: 12,610Success
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:4012,511115,113,740101,530,0002,316,0002,113,536
2May 20, 2026 05:4012,513116,130,152101,525,0002,337,0002,113,536
3May 20, 2026 05:4012,523116,214,933101,603,0002,344,0002,113,536
4May 20, 2026 05:4012,564116,446,483102,266,0002,020,0002,113,536
5May 20, 2026 05:4012,610115,210,314102,592,0002,074,0002,113,536
6May 20, 2026 05:4012,624114,331,166102,727,0002,053,0002,113,536
7May 20, 2026 05:4012,645114,979,615102,884,0002,070,0002,113,536
8May 20, 2026 05:4012,653115,963,757102,962,0002,060,0002,113,536
9May 20, 2026 05:4012,653118,136,792102,936,0002,090,0002,113,536