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 15:13Joad NacerJoad NacerScore: 14,214Success
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 15:1313,644174,628,762113,248,73102,285,568
2Apr 27, 2024 15:1313,683174,269,449113,569,26402,289,664
3Apr 27, 2024 15:1313,748187,874,494114,105,44602,289,664
4Apr 27, 2024 15:1314,212141,603,111115,963,0001,999,0002,285,568
5Apr 27, 2024 15:1314,212146,174,145116,962,000999,0002,285,568
6Apr 27, 2024 15:1314,214139,457,888115,979,0001,999,0002,506,752
7Apr 27, 2024 15:1314,214141,777,144115,979,0001,999,0002,260,992
8Apr 27, 2024 15:1314,225140,090,018116,065,0002,001,0002,519,040
9Apr 27, 2024 15:1314,250141,218,595116,270,0002,004,0002,260,992
10Apr 27, 2024 15:1314,255142,934,215116,314,0002,005,0002,285,568
11Apr 27, 2024 15:1314,317145,878,406116,831,0001,997,0002,285,568
12Apr 27, 2024 15:1314,495143,851,046118,306,0002,005,0002,285,568