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 listApr 27, 2024 15:20Joad NacerJoad NacerScore: 15,642Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 15:2015,530188,221,804128,898,64902,293,760
2Apr 27, 2024 15:2015,565195,417,024129,185,43702,297,856
3Apr 27, 2024 15:2015,579187,035,138129,304,76302,281,472
4Apr 27, 2024 15:2015,620160,546,865128,648,000997,0002,519,040
5Apr 27, 2024 15:2015,623159,982,164128,667,0001,005,0002,285,568
6Apr 27, 2024 15:2015,640157,068,691127,813,0001,997,0002,285,568
7Apr 27, 2024 15:2015,642151,659,092127,835,0001,997,0002,285,568
8Apr 27, 2024 15:2015,647158,288,300127,870,0001,997,0002,260,992
9Apr 27, 2024 15:2015,647157,890,039127,870,0001,997,0002,519,040
10Apr 27, 2024 15:2015,662151,819,835127,997,0001,999,0002,285,568
11Apr 27, 2024 15:2015,975164,096,315132,590,00002,510,848
12Apr 27, 2024 15:2016,244167,811,989133,831,000998,0002,285,568