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 listSep 29, 2026 07:00Karthik ReddyKarthik ReddyScore: 8,037Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 07:007,91976,081,65564,526,0001,202,0002,113,536
2Sep 29, 2026 07:007,92776,060,55464,651,0001,147,0002,113,536
3Sep 29, 2026 07:007,96176,361,01264,921,0001,159,0002,113,536
4Sep 29, 2026 07:008,00176,707,50265,240,0001,171,0002,113,536
5Sep 29, 2026 07:008,03776,975,88565,581,0001,134,0002,113,536
6Sep 29, 2026 07:008,05577,190,40165,687,0001,171,0002,113,536
7Sep 29, 2026 07:008,07877,275,49065,887,0001,166,0002,113,536
8Sep 29, 2026 07:008,09477,469,92665,992,0001,195,0002,113,536
9Sep 29, 2026 07:008,10677,559,40966,137,0001,149,0002,113,536