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 3, 2025 13:49Vladimir EvmenovVladimir EvmenovScore: 1,081,451Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 3, 2025 13:491,052,35925,498,723,2175,208,473,0003,526,103,0002,478,080
2Feb 3, 2025 13:491,081,45124,924,396,3515,258,259,0003,717,785,0002,473,984
3Feb 3, 2025 13:491,082,97725,489,982,7425,257,679,0003,731,026,0002,494,464