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 listOct 13, 2024 23:48Joad NacerJoad NacerScore: 4,713Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 13, 2024 23:484,58964,381,68537,090,0001,002,0002,293,760
2Oct 13, 2024 23:484,64162,378,36938,521,00002,531,328
3Oct 13, 2024 23:484,68667,214,56437,894,000997,0002,273,280
4Oct 13, 2024 23:484,71368,384,87037,111,0002,006,0002,273,280
5Oct 13, 2024 23:484,81064,447,98037,930,0001,996,0002,310,144
6Oct 13, 2024 23:484,97965,875,50339,312,0002,016,0002,531,328