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 listAug 10, 2023 18:03temporary-enlightenmenttemporary-enlightenmentScore: 58,274Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 10, 2023 18:0458,243557,327,169483,414,13702,293,760
2Aug 10, 2023 18:0458,265557,891,153483,603,14302,293,760
3Aug 10, 2023 18:0358,268550,176,605483,627,43302,293,760
4Aug 10, 2023 18:0458,274553,418,453483,676,47402,289,664
5Aug 10, 2023 18:0358,285551,757,287483,765,89602,285,568
6Aug 10, 2023 18:0358,329549,932,251484,127,65002,293,760