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 21:57Bubble BoiBubble BoiScore: 54,684Success
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 21:5554,624507,319,455453,378,52202,232,320
2Feb 10, 2024 21:5554,670515,168,332453,763,34202,232,320
3Feb 10, 2024 21:5754,674516,885,901453,795,14902,240,512
4Feb 10, 2024 21:5554,684519,931,970453,873,41402,244,608
5Feb 10, 2024 21:5754,789528,667,491454,751,97102,236,416
6Feb 10, 2024 21:5754,837510,977,860455,143,73002,236,416