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 20:31Karthik ReddyKarthik ReddyScore: 3,651Success
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 20:323,57238,409,54528,586,0001,064,0002,113,536
2Sep 29, 2026 20:323,59538,771,33728,682,0001,162,0002,113,536
3Sep 29, 2026 20:323,64639,878,88229,128,0001,142,0002,113,536
4Sep 29, 2026 20:323,64639,197,39629,127,0001,140,0002,113,536
5Sep 29, 2026 20:323,65140,535,17629,229,0001,075,0002,113,536
6Sep 29, 2026 20:323,65339,185,40629,173,0001,148,0002,113,536
7Sep 29, 2026 20:323,66139,228,58429,235,0001,153,0002,113,536
8Sep 29, 2026 20:323,66339,361,12729,396,0001,013,0002,113,536
9Sep 29, 2026 20:323,70840,904,61729,625,0001,154,0002,113,536