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 15, 2025 18:14Aleksei ShahoikaAleksei ShahoikaScore: 28,532Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 15, 2025 18:1428,445261,373,640234,094,0002,000,0002,285,568
2Sep 15, 2025 18:1428,477265,960,605235,361,0001,001,0002,285,568
3Sep 15, 2025 18:1428,488260,237,280236,451,00002,285,568
4Sep 15, 2025 18:1428,499267,532,623235,541,0001,002,0002,285,568
5Sep 15, 2025 18:1428,532263,401,755235,820,000999,0002,285,568
6Sep 15, 2025 18:1428,535258,393,089234,841,0001,998,0002,285,568
7Sep 15, 2025 18:1428,557267,742,918235,022,0002,000,0002,269,184
8Sep 15, 2025 18:1428,685261,979,980236,087,0002,000,0002,265,088
9Sep 15, 2025 18:1432,744294,851,757269,776,0001,998,0002,285,568