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 8, 2025 00:02Shikhar SoniShikhar SoniScore: 2,065,894Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 8, 2025 00:022,064,68617,173,319,46617,069,923,00066,972,0002,277,376
2Dec 8, 2025 00:022,064,81217,169,733,81317,059,977,00077,963,0002,277,376
3Dec 8, 2025 00:022,064,93017,168,550,57417,065,952,00072,969,0002,277,376
4Dec 8, 2025 00:022,065,55517,175,341,10717,071,141,00072,966,0002,277,376
5Dec 8, 2025 00:022,065,89417,186,239,79817,070,944,00075,973,0002,277,376
6Dec 8, 2025 00:022,066,04617,180,117,14917,070,211,00077,968,0002,277,376
7Dec 8, 2025 00:022,067,18717,196,749,13117,085,686,00071,964,0002,277,376
8Dec 8, 2025 00:022,070,19417,212,598,02917,105,648,00076,966,0002,277,376
9Dec 8, 2025 00:022,264,12418,825,721,72518,722,258,00069,971,0002,277,376