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 listMar 2, 2026 15:33caandocaandoScore: 5,518Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2026 15:335,40367,133,92242,849,0001,992,0002,371,584
2Mar 2, 2026 15:335,40370,935,92943,846,000996,0002,269,184
3Mar 2, 2026 15:335,40469,519,72042,858,0001,993,0002,514,944
4Mar 2, 2026 15:335,51872,929,85244,805,000995,0002,285,568
5Mar 2, 2026 15:335,51877,440,62143,809,0001,991,0002,285,568
6Mar 2, 2026 15:335,52373,214,59543,849,0001,993,0002,265,088