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 22, 2024 21:00MatthiasMatthiasScore: 72,561Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 22, 2024 21:0072,528623,141,507599,987,0001,999,0002,289,664
2Nov 22, 2024 21:0072,548625,166,358601,145,0001,000,0002,289,664
3Nov 22, 2024 21:0072,554626,401,123601,198,0001,000,0002,289,664
4Nov 22, 2024 21:0072,560625,729,211601,248,0001,000,0002,523,136
5Nov 22, 2024 21:0072,561632,155,687601,255,0001,000,0002,277,376
6Nov 22, 2024 21:0072,561634,433,292601,255,0001,000,0002,289,664
7Nov 22, 2024 21:0072,567634,687,989601,305,0001,000,0002,289,664
8Nov 22, 2024 21:0072,567629,003,820601,303,0001,000,0002,281,472
9Nov 22, 2024 21:0072,717630,270,330601,557,0001,998,0002,367,488