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 10, 2024 16:00zielajzielajScore: 6,790Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 10, 2024 16:006,61375,984,74153,887,000997,0002,535,424
2Nov 10, 2024 16:006,62976,187,60754,020,0001,000,0002,273,280
3Nov 10, 2024 16:006,62981,492,32754,020,0001,000,0002,535,424
4Nov 10, 2024 16:006,63879,886,25353,092,0002,003,0002,433,024
5Nov 10, 2024 16:006,65075,553,11954,192,0001,003,0002,535,424
6Nov 10, 2024 16:006,65175,851,29853,200,0002,007,0002,273,280
7Nov 10, 2024 16:006,79081,352,65956,359,00002,273,280
8Nov 10, 2024 16:006,83480,592,24755,710,0001,012,0002,523,136
9Nov 10, 2024 16:006,87681,152,34255,072,0002,002,0002,273,280
10Nov 10, 2024 16:007,95690,529,99765,033,0001,000,0002,424,832
11Nov 10, 2024 16:007,96293,495,98364,084,0002,002,0002,531,328
12Nov 10, 2024 16:008,773102,647,02871,822,000997,0002,428,928