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 12, 2022 21:56Yuriy LyfenkoYuriy LyfenkoScore: 11,460Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2022 21:5611,449117,602,17293,029,0002,000,0002,277,376
2Feb 12, 2022 21:5611,450118,195,26193,039,0002,000,0002,277,376
3Feb 12, 2022 21:5611,455122,017,14893,076,0002,001,0002,285,568
4Feb 12, 2022 21:5611,457118,843,40093,088,0002,001,0002,277,376
5Feb 12, 2022 21:5611,457122,609,68593,089,0002,001,0002,277,376
6Feb 12, 2022 21:5611,460120,540,15793,117,0002,002,0002,285,568
7Feb 12, 2022 21:5611,460117,875,39593,118,0002,002,0002,396,160
8Feb 12, 2022 21:5611,474116,817,93793,231,0002,004,0002,277,376
9Feb 12, 2022 21:5611,478118,860,22193,261,0002,005,0002,285,568
10Feb 12, 2022 21:5611,935167,642,33899,061,38202,281,472
11Feb 12, 2022 21:5612,182166,935,535101,114,50202,269,184
12Feb 12, 2022 21:5612,190169,222,428101,173,73602,273,280