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 7, 2026 18:57Benn TanBenn TanScore: 11,698Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 7, 2026 18:5710,523115,589,15586,334,0001,003,0002,277,376
2Feb 7, 2026 18:5710,524112,796,17886,344,0001,004,0002,400,256
3Feb 7, 2026 18:5710,534115,153,19087,431,00002,400,256
4Feb 7, 2026 18:5711,698125,530,23095,093,0002,001,0002,273,280
5Feb 7, 2026 18:5711,713121,158,27196,212,0001,002,0002,273,280
6Feb 7, 2026 18:5711,727120,058,24396,334,0001,003,0002,383,872