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 listNov 23, 2024 14:43E SequeiraE SequeiraScore: 13,353Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 23, 2024 14:5113,331135,683,100109,646,0001,005,0002,473,984
2Nov 23, 2024 14:4313,348138,038,904109,793,000998,0002,289,664
3Nov 23, 2024 14:4313,349142,040,905108,802,0001,996,0002,478,080
4Nov 23, 2024 14:5113,349142,933,208108,801,0001,996,0002,318,336
5Nov 23, 2024 14:4313,350138,372,846108,805,0001,996,0002,473,984
6Nov 23, 2024 14:4313,352140,384,240108,822,0001,996,0002,469,888
7Nov 23, 2024 14:4313,353142,076,385109,831,000998,0002,461,696
8Nov 23, 2024 14:4313,357140,864,780108,870,0001,997,0002,289,664
9Nov 23, 2024 14:5113,357137,668,953108,866,0001,997,0002,473,984
10Nov 23, 2024 14:4313,358140,243,324109,875,000998,0002,289,664
11Nov 23, 2024 14:4313,358136,049,079108,877,0001,997,0002,289,664
12Nov 23, 2024 14:4313,370135,625,889108,969,0001,999,0002,469,888