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 27, 2026 07:43Karthik ReddyKarthik ReddyScore: 4,780Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 07:444,70749,365,89137,927,0001,145,0002,113,536
2Sep 27, 2026 07:444,72949,738,62438,098,0001,153,0002,113,536
3Sep 27, 2026 07:444,74749,708,12438,258,0001,148,0002,113,536
4Sep 27, 2026 07:444,76549,950,26438,395,0001,161,0002,113,536
5Sep 27, 2026 07:444,78050,044,48738,531,0001,147,0002,113,536
6Sep 27, 2026 07:444,78149,945,42138,532,0001,156,0002,113,536
7Sep 27, 2026 07:444,80151,403,72038,703,0001,146,0002,113,536
8Sep 27, 2026 07:444,80350,149,59438,721,0001,144,0002,113,536
9Sep 27, 2026 07:444,83950,355,22639,032,0001,139,0002,113,536