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 16, 2024 10:49Huy Duc LeHuy Duc LeScore: 15,382Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 16, 2024 10:4915,294202,071,959126,943,11502,277,376
2Feb 16, 2024 10:4915,305152,355,533125,034,0002,000,0002,273,280
3Feb 16, 2024 10:4915,343158,874,989125,345,0002,005,0002,285,568
4Feb 16, 2024 10:4915,362155,544,499125,510,0001,992,0002,273,280
5Feb 16, 2024 10:4915,367153,851,329126,545,0001,004,0002,285,568
6Feb 16, 2024 10:4915,377152,380,535126,621,0001,004,0002,523,136
7Feb 16, 2024 10:4915,382190,987,094127,673,09102,285,568
8Feb 16, 2024 10:4915,399154,812,981126,814,000998,0002,285,568
9Feb 16, 2024 10:4915,408158,999,172125,888,0001,998,0002,285,568
10Feb 16, 2024 10:4915,422158,863,692127,004,0001,000,0002,285,568
11Feb 16, 2024 10:4915,826191,520,263131,355,15502,285,568
12Feb 16, 2024 10:4915,828156,739,971130,371,0001,002,0002,285,568