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:41M-RochatM-RochatScore: 12,570Success
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:4212,505129,917,705101,774,0002,019,0002,113,536
2May 20, 2026 05:4212,529114,812,968101,989,0002,009,0002,113,536
3May 20, 2026 05:4212,553115,221,635102,108,0002,082,0002,113,536
4May 20, 2026 05:4212,555115,600,606102,165,0002,045,0002,113,536
5May 20, 2026 05:4212,570116,118,642102,266,0002,066,0002,113,536
6May 20, 2026 05:4212,577115,249,223102,323,0002,070,0002,113,536
7May 20, 2026 05:4212,587114,867,638102,378,0002,096,0002,113,536
8May 20, 2026 05:4212,588113,900,139102,422,0002,064,0002,113,536
9May 20, 2026 05:4212,596114,025,185102,492,0002,063,0002,113,536