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 listDec 5, 2025 08:37warshipwarshipScore: 69,388Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2025 08:3769,360605,278,703573,694,0001,998,0002,285,568
2Dec 5, 2025 08:3769,364602,901,394573,721,0001,999,0002,277,376
3Dec 5, 2025 08:3769,373602,213,581573,793,0001,999,0002,285,568
4Dec 5, 2025 08:3769,374604,276,820573,804,0001,999,0002,260,992
5Dec 5, 2025 08:3769,388608,289,754573,924,0001,999,0002,269,184
6Dec 5, 2025 08:3769,463603,372,333575,544,000999,0002,285,568
7Dec 5, 2025 08:3769,477602,823,377574,662,0001,998,0002,265,088
8Dec 5, 2025 08:3769,478606,403,289574,669,0001,998,0002,285,568
9Dec 5, 2025 08:3769,481602,796,720575,697,000999,0002,285,568