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:45Karthik ReddyKarthik ReddyScore: 3,661Success
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:453,63340,637,90128,871,0001,285,0002,113,536
2Sep 29, 2026 20:453,64240,691,21128,948,0001,287,0002,113,536
3Sep 29, 2026 20:453,64640,824,82929,210,0001,054,0002,113,536
4Sep 29, 2026 20:453,65941,054,75229,082,0001,288,0002,113,536
5Sep 29, 2026 20:453,66140,865,73229,108,0001,282,0002,113,536
6Sep 29, 2026 20:453,66640,974,09729,401,0001,029,0002,113,536
7Sep 29, 2026 20:453,67941,138,63329,411,0001,127,0002,113,536
8Sep 29, 2026 20:453,69341,194,03729,625,0001,035,0002,113,536
9Sep 29, 2026 20:453,73241,509,82829,906,0001,077,0002,113,536