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 listMar 15, 2026 12:08eldon-chungeldon-chungScore: 55,403Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 15, 2026 12:0853,452473,646,970441,650,0001,998,0002,265,088
2Mar 15, 2026 12:0853,649467,539,625444,283,0001,000,0002,273,280
3Mar 15, 2026 12:0855,396486,417,919457,788,0001,999,0002,273,280
4Mar 15, 2026 12:0855,403487,676,215456,843,0002,998,0002,273,280
5Mar 15, 2026 12:0855,439490,061,230458,143,0002,000,0002,514,944
6Mar 15, 2026 12:0855,578485,630,119461,299,00002,260,992