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 listJan 8, 2024 13:51Yurkov AlekseyYurkov AlekseyScore: 32,866Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 8, 2024 13:5232,835332,480,378272,529,07802,240,512
2Jan 8, 2024 13:5232,842331,555,102272,586,28002,236,416
3Jan 8, 2024 13:5132,847342,546,871272,627,97202,232,320
4Jan 8, 2024 13:5132,866350,975,140272,787,55202,244,608
5Jan 8, 2024 13:5132,867343,058,540272,796,11102,240,512
6Jan 8, 2024 13:5232,905332,470,841273,109,35902,240,512