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 listDec 21, 2024 12:55mahdi739mahdi739Score: 58,777Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 21, 2024 12:5558,759515,240,232486,701,000999,0002,371,584
2Dec 21, 2024 12:5558,763518,206,175485,733,0001,998,0002,363,392
3Dec 21, 2024 12:5558,766520,947,557486,757,000999,0002,285,568
4Dec 21, 2024 12:5558,771513,115,085485,797,0001,999,0002,371,584
5Dec 21, 2024 12:5558,777512,848,519486,852,000999,0002,285,568
6Dec 21, 2024 12:5558,778519,376,764486,862,000999,0002,375,680
7Dec 21, 2024 12:5558,781514,601,239486,887,000999,0002,285,568
8Dec 21, 2024 12:5558,783510,920,445486,897,000999,0002,281,472
9Dec 21, 2024 12:5558,794508,475,223485,992,0001,999,0002,379,776