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:23Bubble BoiBubble BoiScore: 54,751Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 8, 2024 15:1854,630514,255,316453,430,27402,248,704
2Feb 10, 2024 21:2354,662516,488,923453,697,33902,256,896
3Feb 8, 2024 15:1854,688512,218,904453,908,55002,252,800
4Feb 8, 2024 15:1854,707518,734,457454,066,77302,236,416
5Feb 8, 2024 16:3454,724507,231,622454,208,87102,244,608
6Feb 8, 2024 15:0754,742514,182,218454,357,37902,244,608
7Feb 8, 2024 15:0754,751510,897,401454,436,00002,232,320
8Feb 8, 2024 16:3454,754516,897,376454,456,59002,236,416
9Feb 8, 2024 16:3454,768521,684,671454,573,25602,248,704
10Feb 8, 2024 15:0754,806518,215,772454,888,53202,244,608
11Feb 10, 2024 21:2354,820512,965,714455,006,05602,228,224
12Feb 10, 2024 21:2354,896527,669,834455,638,17402,240,512