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 2, 2026 02:45Karthik ReddyKarthik ReddyError
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 02:45059,761,00649,754,0001,004,0002,113,536expected "53695552264998426 ", got "s269 7308,7156,6553,6416,7938,5797,5553,5363,5253,5173,5090,4989,5038,5010,5027,5044,4968,5005,5010,4958,4946,4887,4920,4918 4949 24876w24713 4946 "
2Oct 2, 2026 02:45059,545,13549,510,0001,032,0002,113,536expected "53688574825915117 ", got "s269 7314,7099,6675,6424,6680,5814,5480,5266,5281,5139,5061,5077,4973,4964,4962,5064,4963,4925,4926,4904,4864,4899,4901,5168 4927 24755w24610 4924 "
3Oct 2, 2026 02:45059,593,29449,520,0001,042,0002,113,536expected "53692111899348337 ", got "s271 7486,7011,6567,6383,6105,5837,5531,5327,5283,5337,5193,5144,5087,4987,4904,4906,4892,5267,4893,4896,4920,4898,4905,4890 4930 24771w24602 4932 "