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 27, 2025 07:40sheryllynn24sheryllynn24Score: 6,369Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2025 07:406,25076,718,67549,878,0001,995,0002,269,184
2Sep 27, 2025 07:406,25483,418,14550,912,000998,0002,289,664
3Sep 27, 2025 07:406,29575,776,42350,241,0002,009,0002,514,944
4Sep 27, 2025 07:406,36981,110,50250,871,0001,994,0002,289,664
5Sep 27, 2025 07:406,37581,208,17850,920,0001,996,0002,289,664
6Sep 27, 2025 07:406,39075,356,10451,035,0002,001,0002,523,136