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 24, 2024 02:31MatthiasMatthiasScore: 10,351Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 24, 2024 02:3110,343111,884,21784,853,000998,0002,285,568
2Nov 24, 2024 02:3110,343112,986,24883,854,0001,996,0002,285,568
3Nov 24, 2024 02:3110,350109,281,71383,912,0001,997,0002,285,568
4Nov 24, 2024 02:3110,351112,768,89783,916,0001,998,0002,523,136
5Nov 24, 2024 02:3110,664110,039,73087,509,0001,005,0002,289,664
6Nov 24, 2024 02:3110,674114,361,46487,587,0001,006,0002,269,184