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 5, 2024 12:36Yingxin JiangYingxin JiangScore: 431,080Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 5, 2024 12:36426,2443,570,988,1763,476,847,00060,979,0002,277,376
2Dec 5, 2024 12:36426,3623,566,720,0343,464,852,00073,954,0002,277,376
3Dec 5, 2024 12:36430,2413,601,475,3623,493,047,00077,956,0002,277,376
4Dec 5, 2024 12:36431,0083,601,549,7963,499,406,00077,964,0002,260,992
5Dec 5, 2024 12:36431,0803,604,288,6423,519,985,00057,983,0002,260,992
6Dec 5, 2024 12:36431,1423,603,567,3783,513,505,00064,972,0002,285,568
7Dec 5, 2024 12:36431,3033,612,840,2013,510,838,00068,977,0002,277,376
8Dec 5, 2024 12:36431,6843,612,912,6973,511,015,00071,959,0002,285,568
9Dec 5, 2024 12:36433,8733,627,440,5433,524,185,00076,960,0002,285,568