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 listDec 8, 2025 11:02warshipwarshipScore: 54,176Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 11:0254,095470,180,857446,991,0001,999,0002,277,376
2Dec 8, 2025 11:0254,113473,699,435448,136,0001,000,0002,285,568
3Dec 8, 2025 11:0254,134470,425,851448,310,0001,000,0002,531,328
4Dec 8, 2025 11:0254,146475,556,737448,408,0001,000,0002,285,568
5Dec 8, 2025 11:0254,176474,141,852448,665,000999,0002,265,088
6Dec 8, 2025 11:0254,184481,285,616447,731,0001,998,0002,285,568
7Dec 8, 2025 11:0254,185476,626,272447,736,0001,998,0002,285,568
8Dec 8, 2025 11:0254,219472,714,417449,017,0001,000,0002,285,568
9Dec 8, 2025 11:0254,259472,283,058450,352,00002,260,992