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 listOct 27, 2025 04:43Tan Lip WeiTan Lip WeiScore: 31,122Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 04:4331,094284,842,129257,083,0001,000,0002,285,568
2Oct 27, 2025 04:4331,109280,435,078256,205,0002,001,0002,285,568
3Oct 27, 2025 04:4331,110280,634,227256,215,0002,001,0002,265,088
4Oct 27, 2025 04:4331,112280,727,359257,230,0001,000,0002,285,568
5Oct 27, 2025 04:4331,122280,472,750256,308,0002,002,0002,285,568
6Oct 27, 2025 04:4331,128282,071,607257,364,0001,001,0002,265,088
7Oct 27, 2025 04:4331,175283,016,914256,754,0001,998,0002,371,584
8Oct 27, 2025 04:4331,191285,432,829257,888,000999,0002,277,376
9Oct 27, 2025 04:4331,225280,916,647258,166,0001,000,0002,285,568