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 14, 2024 22:54Manuel PepeManuel PepeScore: 109,584Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 14, 2024 22:54109,503938,466,402905,872,0002,999,0002,482,176
2Nov 14, 2024 22:54109,530935,277,959906,098,0003,000,0002,478,080
3Nov 14, 2024 22:54109,546936,779,692909,228,00002,482,176
4Nov 14, 2024 22:54109,567934,933,273906,405,0002,998,0002,482,176
5Nov 14, 2024 22:54109,584936,641,588905,547,0003,998,0002,326,528
6Nov 14, 2024 22:54109,675940,944,161905,303,0004,996,0002,326,528
7Nov 14, 2024 22:54109,694935,893,685908,460,0001,998,0002,326,528
8Nov 14, 2024 22:54109,707943,593,126908,565,0001,999,0002,469,888
9Nov 14, 2024 22:54109,720939,243,145906,674,0003,998,0002,482,176