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:30zielajzielajError
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:2900000Error: Killed by timeoutstderr
2Nov 15, 2024 01:303,80558,787,56030,564,0001,018,0002,351,104
3Nov 15, 2024 01:303,82063,790,47731,705,00002,338,816
4Nov 15, 2024 01:303,83850,921,91730,864,000995,0002,412,544
5Nov 15, 2024 01:303,89254,852,83732,302,00002,363,392
6Nov 15, 2024 01:303,92958,703,02432,608,00002,367,488
7Nov 15, 2024 01:303,93160,706,36532,625,00002,269,184