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 listFeb 21, 2025 18:35alfaixalfaixScore: 1,826,837Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 21, 2025 18:351,824,37415,172,641,47715,072,335,00069,969,0002,277,376
2Feb 21, 2025 18:351,825,01315,187,387,55315,064,650,00082,954,0002,277,376
3Feb 21, 2025 18:351,825,25815,179,931,51915,073,679,00075,963,0002,277,376
4Feb 21, 2025 18:351,826,76815,193,094,66015,095,202,00066,969,0002,277,376
5Feb 21, 2025 18:351,826,83715,193,868,03015,087,783,00074,964,0002,277,376
6Feb 21, 2025 18:351,827,01115,194,102,62215,092,222,00071,967,0002,289,664
7Feb 21, 2025 18:351,827,26415,196,916,18815,088,326,00077,965,0002,277,376
8Feb 21, 2025 18:351,830,40215,220,448,28715,122,365,00069,969,0002,277,376
9Feb 21, 2025 18:351,862,75215,490,261,60615,379,878,00080,967,0002,277,376