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 listAug 4, 2026 04:58limanjun99limanjun99Score: 4,903Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 4, 2026 04:584,78749,912,10137,447,0002,289,0002,113,536
2Aug 4, 2026 04:584,83050,120,36637,882,0002,214,0002,113,536
3Aug 4, 2026 04:584,86950,404,86138,130,0002,289,0002,113,536
4Aug 4, 2026 04:584,88150,526,73337,215,0003,298,0002,113,536
5Aug 4, 2026 04:584,90350,776,66437,397,0003,305,0002,113,536
6Aug 4, 2026 04:584,94150,950,54038,772,0002,239,0002,113,536
7Aug 4, 2026 04:584,97651,369,12037,914,0003,395,0002,113,536
8Aug 4, 2026 04:585,00151,627,56837,860,0003,652,0002,113,536
9Aug 4, 2026 04:585,02652,039,75538,423,0003,300,0002,113,536