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 17, 2024 01:29zielajzielajScore: 3,542Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 17, 2024 01:293,49151,406,68826,976,0001,998,0002,523,136
2Nov 17, 2024 01:293,50251,234,05227,060,0002,004,0002,383,872
3Nov 17, 2024 01:293,51251,311,60427,139,0002,010,0002,531,328
4Nov 17, 2024 01:293,51551,952,28427,160,0002,011,0002,379,776
5Nov 17, 2024 01:293,52351,878,47327,226,0002,016,0002,457,600
6Nov 17, 2024 01:293,53252,973,30228,305,0001,010,0002,523,136
7Nov 17, 2024 01:293,54252,401,58028,389,0001,013,0002,383,872
8Nov 17, 2024 01:293,54356,051,36928,394,0001,014,0002,523,136
9Nov 17, 2024 01:293,55361,682,38628,472,0001,016,0002,379,776
10Nov 17, 2024 01:293,67651,447,03229,495,0001,017,0002,527,232
11Nov 17, 2024 01:293,73851,005,89029,027,0002,001,0002,379,776
12Nov 17, 2024 01:293,74257,399,54930,057,0001,001,0002,527,232