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 1, 2025 21:30E SequeiraE SequeiraScore: 64,383Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 1, 2025 21:3064,288557,770,264473,634,00059,953,0002,289,664
2Feb 1, 2025 21:3064,383560,135,620468,329,00066,046,0002,400,256
3Feb 1, 2025 21:3064,409560,286,238480,633,00053,958,0002,277,376