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 7, 2025 10:52AaronAaronScore: 1,826,970Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 7, 2025 10:521,824,41915,181,755,95115,081,705,00060,970,0002,277,376
2Apr 7, 2025 10:521,826,30015,193,704,49815,090,320,00067,969,0002,277,376
3Apr 7, 2025 10:521,826,30915,190,330,96915,081,400,00076,966,0002,277,376
4Apr 7, 2025 10:521,826,32715,187,638,60515,091,541,00066,971,0002,289,664
5Apr 7, 2025 10:521,826,97015,197,736,94315,099,881,00063,974,0002,277,376
6Apr 7, 2025 10:521,827,28015,198,080,36215,097,455,00068,965,0002,277,376
7Apr 7, 2025 10:521,828,79415,213,372,60415,107,021,00071,971,0002,277,376
8Apr 7, 2025 10:521,831,36815,235,297,36815,117,395,00082,963,0002,277,376
9Apr 7, 2025 10:521,832,62015,239,966,47915,154,771,00055,976,0002,269,184