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 listFeb 16, 2025 19:15Ian MckibbenIan MckibbenScore: 29,973Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2025 19:1529,970279,177,645247,755,000999,0002,269,184
2Feb 16, 2025 19:1529,971274,795,215247,760,000999,0002,531,328
3Feb 16, 2025 19:1529,971275,415,083246,765,0001,998,0002,428,928
4Feb 16, 2025 19:1529,972277,435,057247,771,000999,0002,437,120
5Feb 16, 2025 19:1529,973281,648,351247,774,000999,0002,531,328
6Feb 16, 2025 19:1529,973276,118,938247,774,000999,0002,269,184
7Feb 16, 2025 19:1529,977274,253,827246,810,0001,998,0002,269,184
8Feb 16, 2025 19:1529,985273,879,802247,874,000999,0002,531,328
9Feb 16, 2025 19:1529,988269,967,189247,898,000999,0002,269,184