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 19:29Joad NacerJoad NacerScore: 13,022Success
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 19:2912,867176,383,927106,799,23202,273,280
2Apr 27, 2024 19:2912,907174,358,214107,126,94402,277,376
3Apr 27, 2024 19:2912,970133,244,572106,652,000996,0002,285,568
4Apr 27, 2024 19:2912,989140,567,313105,811,0001,996,0002,285,568
5Apr 27, 2024 19:2912,990134,852,781105,822,0001,996,0002,510,848
6Apr 27, 2024 19:2912,990133,622,159105,824,0001,996,0002,285,568
7Apr 27, 2024 19:2913,022135,608,128106,080,0002,001,0002,514,944
8Apr 27, 2024 19:2913,025131,595,619106,103,0002,001,0002,285,568
9Apr 27, 2024 19:2913,044134,278,273106,261,0002,004,0002,510,848
10Apr 27, 2024 19:2913,064129,980,442106,421,0002,007,0002,285,568
11Apr 27, 2024 19:2913,143142,886,925107,088,0002,001,0002,510,848
12Apr 27, 2024 19:2913,720181,927,339113,874,78502,273,280