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 26, 2025 19:06sheryllynn24sheryllynn24Score: 6,506Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 26, 2025 19:066,37778,375,43650,933,0001,997,0002,260,992
2Sep 26, 2025 19:066,38477,926,88950,987,0001,999,0002,519,040
3Sep 26, 2025 19:066,38674,314,24051,002,0002,000,0002,285,568
4Sep 26, 2025 19:066,50684,237,78152,003,0002,000,0002,265,088
5Sep 26, 2025 19:066,50679,427,64252,000,0002,000,0002,269,184
6Sep 26, 2025 19:066,51380,594,37552,058,0002,002,0002,285,568