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 17, 2025 19:05Aleksei ShahoikaAleksei ShahoikaScore: 15,789Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 17, 2025 19:0515,777153,058,058128,953,0001,999,0002,285,568
2Sep 17, 2025 19:0515,782153,939,293129,991,000999,0002,519,040
3Sep 17, 2025 19:0515,784154,973,114130,006,0001,000,0002,285,568
4Sep 17, 2025 19:0515,786154,217,233129,022,0002,000,0002,269,184
5Sep 17, 2025 19:0515,789155,791,021129,050,0002,000,0002,285,568
6Sep 17, 2025 19:0515,790153,717,140129,060,0002,000,0002,285,568
7Sep 17, 2025 19:0515,804155,424,249129,175,0002,002,0002,265,088
8Sep 17, 2025 19:0515,823160,347,368130,329,0001,002,0002,285,568
9Sep 17, 2025 19:0515,843158,197,946130,492,0001,003,0002,285,568