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 27, 2024 12:27Joad NacerJoad NacerScore: 14,226Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 27, 2024 12:2713,654178,467,676113,330,91302,281,472
2Apr 27, 2024 12:2713,746176,978,159114,091,84102,273,280
3Apr 27, 2024 12:2713,778176,766,619114,360,43802,285,568
4Apr 27, 2024 12:2714,210143,741,160115,943,0001,999,0002,519,040
5Apr 27, 2024 12:2714,212141,733,764115,964,0001,999,0002,514,944
6Apr 27, 2024 12:2714,224143,493,453116,061,0002,001,0002,285,568
7Apr 27, 2024 12:2714,226141,557,178117,074,0001,000,0002,510,848
8Apr 27, 2024 12:2714,329142,127,040116,935,0001,998,0002,519,040
9Apr 27, 2024 12:2714,452140,803,627117,952,0001,999,0002,277,376
10Apr 27, 2024 12:2714,694154,038,119120,961,000999,0002,285,568
11Apr 27, 2024 12:2715,114152,989,038124,440,0001,003,0002,285,568
12Apr 27, 2024 12:2715,204149,595,093124,191,0002,003,0002,285,568