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 listApr 30, 2025 10:17vahookvahookScore: 2,065,541Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 30, 2025 10:172,061,48517,143,973,20217,048,356,00061,972,0002,285,568
2Apr 30, 2025 10:172,062,63717,153,962,15017,053,917,00065,972,0002,277,376
3Apr 30, 2025 10:172,064,77217,179,129,38017,075,634,00061,973,0002,277,376
4Apr 30, 2025 10:172,065,22217,175,843,57117,076,372,00064,970,0002,289,664
5Apr 30, 2025 10:172,065,54117,176,772,56317,080,019,00063,970,0002,277,376
6Apr 30, 2025 10:172,066,05917,185,177,37017,065,335,00082,957,0002,277,376
7Apr 30, 2025 10:172,067,39017,189,497,04217,097,363,00061,975,0002,285,568
8Apr 30, 2025 10:172,067,61617,193,427,37417,086,242,00074,970,0002,277,376
9Apr 30, 2025 10:172,068,00217,197,535,38417,084,457,00079,960,0002,277,376