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 listAug 18, 2025 07:59Ahmed MhedhbiAhmed MhedhbiScore: 52,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 07:5952,383458,554,860432,778,0001,998,0002,273,280
2Aug 18, 2025 07:5952,403457,599,967432,945,0001,999,0002,404,352
3Aug 18, 2025 07:5952,403457,049,266433,946,000999,0002,392,064
4Aug 18, 2025 07:5952,407456,775,113432,979,0001,999,0002,273,280
5Aug 18, 2025 07:5952,416463,819,962433,055,0002,000,0002,273,280
6Aug 18, 2025 07:5952,424457,370,258434,116,0001,000,0002,256,896
7Aug 18, 2025 07:5952,426461,036,523435,134,00002,273,280
8Aug 18, 2025 07:5952,433460,003,964435,194,00002,273,280
9Aug 18, 2025 07:5952,444467,881,640434,282,0001,000,0002,273,280