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 13, 2025 23:31Aniruddha DebAniruddha DebScore: 33,024Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 13, 2025 23:3133,000296,165,232272,897,000999,0002,428,928
2Feb 13, 2025 23:3133,008298,048,960271,966,0001,999,0002,269,184
3Feb 13, 2025 23:3133,016296,908,787273,034,0001,000,0002,523,136
4Feb 13, 2025 23:3133,021299,009,660272,075,0002,000,0002,420,736
5Feb 13, 2025 23:3133,024298,690,842273,099,0001,000,0002,433,024
6Feb 13, 2025 23:3133,032301,186,236273,163,0001,000,0002,433,024
7Feb 13, 2025 23:3133,034302,155,931272,178,0002,001,0002,531,328
8Feb 13, 2025 23:3133,045304,813,220273,280,000997,0002,531,328
9Feb 13, 2025 23:3133,054302,565,964272,357,0001,995,0002,433,024