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 listMay 1, 2025 21:42FeToR1FeToR1Score: 2,065,432Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1May 1, 2025 21:422,058,01517,110,402,25217,018,552,00062,976,0002,285,568
2May 1, 2025 21:422,064,18117,164,401,82017,071,736,00060,970,0002,277,376
3May 1, 2025 21:422,064,32517,167,946,90917,056,927,00076,968,0002,260,992
4May 1, 2025 21:422,064,49217,174,055,46517,059,316,00075,965,0002,277,376
5May 1, 2025 21:422,065,43217,178,469,88917,076,119,00066,969,0002,281,472
6May 1, 2025 21:422,065,73617,180,867,21917,051,651,00093,959,0002,289,664
7May 1, 2025 21:422,065,77017,176,854,99917,067,935,00077,958,0002,289,664
8May 1, 2025 21:422,065,92917,177,133,24217,083,236,00063,974,0002,277,376
9May 1, 2025 21:422,069,26017,205,353,92517,103,892,00070,970,0002,277,376