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 listDec 15, 2025 11:50Pavitra GolchhaPavitra GolchhaScore: 158,425Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 15, 2025 11:50158,0031,338,559,4971,080,529,000230,899,0002,473,984
2Dec 15, 2025 11:50158,0321,340,762,0711,078,904,000232,763,0002,469,888
3Dec 15, 2025 11:50158,1751,339,813,2601,081,057,000231,797,0002,314,240
4Dec 15, 2025 11:50158,2271,339,822,6611,080,408,000232,872,0002,478,080
5Dec 15, 2025 11:50158,4251,340,606,0931,081,119,000233,809,0002,473,984
6Dec 15, 2025 11:50158,5911,339,618,5811,082,429,000233,876,0002,465,792
7Dec 15, 2025 11:50158,6351,347,455,6701,082,907,000233,764,0002,318,336
8Dec 15, 2025 11:50158,6711,341,439,2741,082,152,000234,816,0002,469,888
9Dec 15, 2025 11:50158,7001,343,366,0001,081,349,000235,858,0002,469,888