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

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 11, 2024 00:2054,642527,008,224453,529,02002,240,512
2Feb 10, 2024 22:0754,647521,338,302453,573,77802,244,608
3Feb 11, 2024 00:2054,684508,333,365453,880,70102,240,512
4Feb 10, 2024 22:0754,688531,247,922453,911,58502,244,608
5Feb 11, 2024 00:2054,718510,830,292454,161,35602,244,608
6Feb 10, 2024 22:0754,830522,598,626455,091,35602,240,512