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 10, 2024 22:02Bubble BoiBubble BoiScore: 54,700Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 10, 2024 22:0254,584508,727,920453,043,17102,244,608
2Feb 10, 2024 21:5854,614507,299,421453,298,61802,232,320
3Feb 10, 2024 21:5854,649506,663,304453,590,77002,236,416
4Feb 10, 2024 22:0254,700508,525,763454,013,86202,232,320
5Feb 10, 2024 21:5854,758523,942,586454,489,22502,240,512
6Feb 10, 2024 22:0254,808524,762,928454,904,65602,244,608