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 7, 2025 19:51Yehor BondarYehor BondarScore: 2,068,773Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Nov 7, 2025 19:512,064,00817,162,206,04517,065,298,00065,970,0002,260,992
2Nov 7, 2025 19:512,065,18517,174,550,31117,058,081,00082,956,0002,277,376
3Nov 7, 2025 19:512,066,69517,196,670,76817,094,593,00058,974,0002,285,568
4Nov 7, 2025 19:512,068,45017,204,721,34717,100,167,00067,964,0002,375,680
5Nov 7, 2025 19:512,068,77317,208,937,74017,109,844,00060,970,0002,277,376
6Nov 7, 2025 19:512,068,88517,206,770,54617,114,774,00056,969,0002,519,040
7Nov 7, 2025 19:512,069,69417,209,875,43317,115,490,00062,972,0002,277,376
8Nov 7, 2025 19:512,074,08917,247,382,56217,130,979,00083,960,0002,277,376
9Nov 7, 2025 19:512,074,69817,251,343,56717,175,011,00044,979,0002,277,376