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 15, 2025 01:32Aniruddha DebAniruddha DebScore: 20,529Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 15, 2025 01:3220,505196,389,211169,190,0001,001,0002,269,184
2Feb 15, 2025 01:3220,522191,960,373169,329,0001,001,0002,433,024
3Feb 15, 2025 01:3220,525190,926,181169,359,0001,002,0002,510,848
4Feb 15, 2025 01:3220,526193,155,472169,367,0001,002,0002,433,024
5Feb 15, 2025 01:3220,529196,135,020169,387,0001,002,0002,531,328
6Feb 15, 2025 01:3220,529191,708,938169,387,0001,002,0002,531,328
7Feb 15, 2025 01:3220,531192,504,829169,403,0001,002,0002,531,328
8Feb 15, 2025 01:3220,531195,638,572170,407,00002,433,024
9Feb 15, 2025 01:3220,534194,194,525169,429,0001,002,0002,269,184