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 listSep 11, 2024 14:26Dmitrii KravchenkoDmitrii KravchenkoScore: 84,247Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 11, 2024 14:2683,778722,507,606495,542,000199,815,0002,342,912
2Sep 11, 2024 14:2683,793715,815,735496,631,000198,852,0002,342,912
3Sep 11, 2024 14:2683,987728,137,406496,355,000200,739,0002,473,984
4Sep 11, 2024 14:2684,214726,688,503495,984,000202,993,0002,445,312
5Sep 11, 2024 14:2684,247726,233,256496,469,000202,783,0002,342,912
6Sep 11, 2024 14:2684,394723,562,034496,627,000203,846,0002,347,008
7Sep 11, 2024 14:2684,553730,468,766495,853,000205,938,0002,449,408
8Sep 11, 2024 14:2684,602725,250,384496,431,000205,764,0002,355,200
9Sep 11, 2024 14:2684,675731,510,003495,861,000206,942,0002,281,472