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 15, 2024 01:31zielajzielajScore: 3,731Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 15, 2024 01:313,71856,287,23429,862,000995,0002,347,008
2Nov 15, 2024 01:313,71957,310,56428,878,0001,991,0002,441,216
3Nov 15, 2024 01:313,72153,599,76228,893,0001,992,0002,347,008
4Nov 15, 2024 01:313,72856,526,60529,946,000998,0002,351,104
5Nov 15, 2024 01:313,72854,939,27829,943,000998,0002,523,136
6Nov 15, 2024 01:313,72958,693,22629,956,000998,0002,355,200
7Nov 15, 2024 01:313,73157,787,28829,971,000999,0002,342,912
8Nov 15, 2024 01:313,74552,383,52730,082,0001,002,0002,527,232
9Nov 15, 2024 01:313,75055,801,00630,125,0001,004,0002,351,104
10Nov 15, 2024 01:313,83654,779,33530,843,000994,0002,277,376
11Nov 15, 2024 01:313,85752,821,51631,017,0001,000,0002,277,376
12Nov 15, 2024 01:313,86753,286,73831,095,0001,003,0002,367,488