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:02E SequeiraE SequeiraScore: 81,153Success
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:0281,086696,371,480611,014,00062,001,0002,326,528
2Feb 1, 2025 21:0281,153700,232,894624,604,00048,969,0002,326,528
3Feb 1, 2025 21:0281,242704,817,002623,284,00051,023,0002,326,528