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 07:49Weitao WanWeitao WanScore: 43,709Success
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 07:4943,697384,122,550360,684,0001,998,0002,281,472
2Oct 27, 2025 07:4943,699389,754,862360,703,0001,998,0002,269,184
3Oct 27, 2025 07:4943,701391,308,003360,718,0001,998,0002,285,568
4Oct 27, 2025 07:4943,702389,668,288362,727,00002,273,280
5Oct 27, 2025 07:4943,709385,894,165360,787,0001,998,0002,285,568
6Oct 27, 2025 07:4943,711385,160,257360,804,0001,998,0002,269,184
7Oct 27, 2025 07:4943,724385,439,240360,911,0001,999,0002,367,488
8Oct 27, 2025 07:4943,724387,824,301360,914,0001,999,0002,265,088
9Oct 27, 2025 07:4944,021390,567,724363,381,0001,996,0002,285,568