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 listFeb 21, 2026 23:04MathSOMathSOScore: 192,310Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2026 23:04191,7561,618,129,0371,492,599,00098,973,0002,318,336
2Feb 21, 2026 23:04191,9431,618,318,3221,484,187,000108,940,0002,318,336
3Feb 21, 2026 23:04192,0821,621,586,3931,497,327,00096,956,0002,371,584
4Feb 21, 2026 23:04192,2961,621,797,7821,497,117,00098,941,0002,318,336
5Feb 21, 2026 23:04192,3101,620,010,4761,500,223,00095,950,0002,330,624
6Feb 21, 2026 23:04192,4121,624,853,4741,492,021,000105,001,0002,318,336
7Feb 21, 2026 23:04192,4421,620,994,6701,493,316,000103,952,0002,330,624
8Feb 21, 2026 23:04192,4561,626,334,3761,497,423,00099,961,0002,318,336
9Feb 21, 2026 23:04193,1981,628,685,7091,508,570,00094,972,0002,330,624