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:05E SequeiraE SequeiraScore: 81,507Success
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:0581,462704,206,719614,124,00062,012,0002,367,488
2Feb 1, 2025 21:0581,507708,964,545617,551,00058,957,0002,326,528
3Feb 1, 2025 21:0581,516702,201,419615,622,00060,962,0002,326,528