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 00:38zielajzielajScore: 3,978Success
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 00:383,96354,569,68630,896,0001,993,0002,273,280
2Nov 15, 2024 00:383,96553,222,71831,914,000997,0002,359,296
3Nov 15, 2024 00:383,97054,880,61731,955,000998,0002,367,488
4Nov 15, 2024 00:383,97854,812,62632,021,0001,000,0002,277,376
5Nov 15, 2024 00:383,98056,260,94631,035,0002,002,0002,535,424
6Nov 15, 2024 00:384,00263,440,82832,208,0001,006,0002,535,424