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 26, 2024 22:22Joad NacerJoad NacerScore: 20,116Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 26, 2024 22:2217,761214,395,740147,415,59402,260,992
2Apr 26, 2024 22:2217,771213,494,147147,502,18202,269,184
3Apr 26, 2024 22:2218,346217,721,259152,269,08802,277,376
4Apr 26, 2024 22:2220,102193,114,175164,849,0001,998,0002,510,848
5Apr 26, 2024 22:2220,106189,927,860165,878,000999,0002,260,992
6Apr 26, 2024 22:2220,112185,045,448164,934,0001,999,0002,285,568
7Apr 26, 2024 22:2220,116192,924,288165,966,000999,0002,285,568
8Apr 26, 2024 22:2220,125196,544,228166,038,0001,000,0002,285,568
9Apr 26, 2024 22:2220,137194,578,062166,136,0001,000,0002,285,568
10Apr 26, 2024 22:2220,141195,176,950165,166,0002,002,0002,285,568
11Apr 26, 2024 22:2220,144192,780,084165,195,0002,002,0002,285,568
12Apr 26, 2024 22:2220,744198,580,605170,173,0002,002,0002,506,752