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 2, 2024 16:39Bubble BoiBubble BoiScore: 75,649Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 2, 2024 16:4170,327653,640,978583,710,71902,240,512
2Feb 2, 2024 16:4170,329641,858,192583,733,14602,248,704
3Feb 2, 2024 16:4170,340654,687,138583,821,97702,248,704
4Feb 2, 2024 16:3775,571704,441,054627,239,89002,240,512
5Feb 2, 2024 16:3775,649694,410,696627,888,81702,252,800
6Feb 2, 2024 16:3775,703701,351,110628,332,67702,240,512
7Feb 2, 2024 16:3975,705699,853,577628,349,39602,240,512
8Feb 2, 2024 16:3975,746691,986,633628,692,70302,260,992
9Feb 2, 2024 16:3975,761692,853,451628,817,04102,244,608