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 24, 2024 09:05Sean DewarSean DewarScore: 1,214,057Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 24, 2024 09:051,204,56110,025,707,0199,914,897,00082,957,0002,277,376
2Dec 24, 2024 09:051,210,70310,077,054,6199,963,882,00084,956,0002,277,376
3Dec 24, 2024 09:051,212,11010,091,236,6119,997,540,00062,971,0002,277,376
4Dec 24, 2024 09:051,213,76010,105,095,1399,997,248,00076,963,0002,277,376
5Dec 24, 2024 09:051,214,05710,108,001,2149,994,720,00081,956,0002,277,376
6Dec 24, 2024 09:051,216,07310,123,199,71710,011,442,00081,962,0002,289,664
7Dec 24, 2024 09:051,216,53110,125,250,12110,022,246,00074,964,0002,285,568
8Dec 24, 2024 09:051,216,54410,123,763,24410,039,344,00057,973,0002,277,376
9Dec 24, 2024 09:051,218,63310,144,230,63610,056,679,00057,975,0002,285,568