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 3, 2026 07:26Priyansh RathiPriyansh RathiScore: 41,174Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 3, 2026 07:2641,048363,699,032337,701,0002,997,0002,396,160
2Mar 3, 2026 07:2641,121367,547,169340,302,0001,000,0002,371,584
3Mar 3, 2026 07:2641,135370,267,589341,420,00002,543,616
4Mar 3, 2026 07:2641,160368,809,317339,628,0001,997,0002,396,160
5Mar 3, 2026 07:2641,174375,206,290338,747,0002,997,0002,359,296
6Mar 3, 2026 07:2641,175375,287,042339,758,0001,998,0002,371,584
7Mar 3, 2026 07:2641,221372,407,334339,132,0003,001,0002,387,968
8Mar 3, 2026 07:2641,238368,252,798340,271,0002,001,0002,510,848
9Mar 3, 2026 07:2641,239368,614,415341,286,0001,000,0002,543,616