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:33Aniruddha DebAniruddha DebScore: 20,527Success
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:3320,496192,641,999168,114,0002,001,0002,531,328
2Feb 15, 2025 01:3320,501192,516,245169,158,0001,000,0002,531,328
3Feb 15, 2025 01:3320,523191,291,441169,343,0001,002,0002,428,928
4Feb 15, 2025 01:3320,526194,120,568170,368,00002,433,024
5Feb 15, 2025 01:3320,527194,927,698169,372,0001,002,0002,437,120
6Feb 15, 2025 01:3320,528194,633,218169,382,0001,002,0002,428,928
7Feb 15, 2025 01:3320,532192,540,771170,414,00002,510,848
8Feb 15, 2025 01:3320,537196,376,817169,458,000996,0002,433,024
9Feb 15, 2025 01:3320,540198,683,069169,486,000996,0002,531,328