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 listFeb 13, 2024 17:49Bubble BoiBubble BoiScore: 50,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2024 17:4950,744477,786,173421,179,05602,240,512
2Feb 13, 2024 17:4850,745491,961,618421,186,55102,244,608
3Feb 13, 2024 17:4850,772491,295,690421,410,52502,240,512
4Feb 13, 2024 17:4950,778484,576,822421,456,97302,248,704
5Feb 13, 2024 17:4950,838476,564,422421,959,32502,252,800
6Feb 13, 2024 17:4950,841484,590,335421,977,04902,240,512
7Feb 13, 2024 17:4850,854493,384,666422,092,10202,244,608
8Feb 13, 2024 17:4950,877482,633,683422,276,92802,244,608
9Feb 13, 2024 17:4950,940490,675,312422,802,75502,232,320