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 9, 2025 06:42Chaitanya GargChaitanya GargScore: 2,067,659Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 9, 2025 06:422,062,99717,163,224,51617,055,908,00066,968,0002,289,664
2Dec 9, 2025 06:422,065,17617,172,736,10117,068,986,00071,974,0002,277,376
3Dec 9, 2025 06:422,067,06617,186,324,65517,088,671,00067,974,0002,277,376
4Dec 9, 2025 06:422,067,38817,190,144,54217,086,351,00072,971,0002,277,376
5Dec 9, 2025 06:422,067,65917,201,387,32817,100,598,00060,973,0002,277,376
6Dec 9, 2025 06:422,067,81217,194,076,15217,098,864,00063,973,0002,277,376
7Dec 9, 2025 06:422,067,85817,196,505,58617,108,249,00054,975,0002,277,376
8Dec 9, 2025 06:422,069,77017,208,510,54017,116,118,00062,971,0002,289,664
9Dec 9, 2025 06:422,108,34517,537,959,80217,435,294,00063,968,0002,260,992