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 16, 2024 23:18zielajzielajScore: 3,838Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 16, 2024 23:183,53157,700,60826,275,0003,031,0002,527,232
2Nov 16, 2024 23:183,54255,793,27829,399,00002,347,008
3Nov 16, 2024 23:183,54452,243,20928,404,0001,014,0002,523,136
4Nov 16, 2024 23:183,83858,434,71330,859,000995,0002,277,376
5Nov 16, 2024 23:183,97658,262,14331,998,000999,0002,531,328
6Nov 16, 2024 23:184,04360,638,80232,540,0001,016,0002,277,376