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 9, 2024 03:00MikeMikeScore: 78,549Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 9, 2024 03:0078,527685,831,866650,774,000999,0002,318,336
2Oct 9, 2024 03:0078,544675,304,430649,914,0001,999,0002,318,336
3Oct 9, 2024 03:0078,544680,098,117649,913,0001,999,0002,322,432
4Oct 9, 2024 03:0078,546677,087,124650,930,000999,0002,318,336
5Oct 9, 2024 03:0078,549676,214,321649,954,0001,999,0002,465,792
6Oct 9, 2024 03:0078,560674,998,894648,049,0004,000,0002,465,792
7Oct 9, 2024 03:0078,571677,459,552650,139,0002,000,0002,322,432
8Oct 9, 2024 03:0078,588682,950,757651,282,0001,000,0002,318,336
9Oct 9, 2024 03:0078,601684,301,494650,389,0001,998,0002,322,432