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:52Ahmed MhedhbiAhmed MhedhbiScore: 65,748Success
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:5265,589570,896,781543,387,0001,000,0002,273,280
2Aug 18, 2025 07:5265,641567,096,981543,819,000999,0002,273,280
3Aug 18, 2025 07:5265,700568,212,302545,311,00002,273,280
4Aug 18, 2025 07:5265,743573,054,764543,666,0001,998,0002,396,160
5Aug 18, 2025 07:5265,748567,560,390544,710,000999,0002,519,040
6Aug 18, 2025 07:5265,754572,064,445544,756,000999,0002,396,160
7Aug 18, 2025 07:5265,755578,615,474543,768,0001,999,0002,273,280
8Aug 18, 2025 07:5265,763569,880,095544,833,000999,0002,273,280
9Aug 18, 2025 07:5265,765573,125,279543,850,0001,999,0002,273,280