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 19:46E SequeiraE SequeiraScore: 87,790Success
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 19:4687,625760,342,448725,291,0002,000,0002,473,984
2Feb 1, 2025 19:4687,790757,207,267726,655,0001,999,0002,326,528
3Feb 1, 2025 19:4687,888760,656,653726,474,0002,997,0002,326,528