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 20:10E SequeiraE SequeiraScore: 109,393Success
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 20:10109,393928,608,380905,966,0001,999,0002,326,528
2Feb 1, 2025 20:10109,393929,490,701902,964,0004,999,0002,281,472
3Feb 1, 2025 20:10109,446933,284,980905,400,0002,998,0002,326,528