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 listApr 7, 2024 09:17E SequeiraE SequeiraScore: 55,774Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2024 08:5854,926510,635,963455,889,41102,277,376
2Apr 7, 2024 09:1255,711517,290,599462,402,11602,273,280
3Apr 7, 2024 08:5855,748531,945,520462,708,22102,273,280
4Apr 7, 2024 09:1755,753523,698,360462,745,88902,269,184
5Apr 7, 2024 08:5855,774518,666,353462,927,83102,281,472
6Apr 7, 2024 09:1256,807550,049,498471,495,70002,277,376
7Apr 7, 2024 09:1256,809537,603,650471,517,20002,285,568
8Apr 7, 2024 09:1756,835530,160,955471,727,48302,273,280
9Apr 7, 2024 09:1756,837537,077,195471,748,90702,269,184