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 14, 2025 00:12Aniruddha DebAniruddha DebScore: 23,612Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 14, 2025 00:1223,594213,334,765193,833,0001,998,0002,420,736
2Feb 14, 2025 00:1223,595218,524,651194,839,000999,0002,510,848
3Feb 14, 2025 00:1223,608217,631,158194,945,000999,0002,437,120
4Feb 14, 2025 00:1223,610220,324,426194,962,000999,0002,531,328
5Feb 14, 2025 00:1223,612220,133,443193,980,0001,999,0002,531,328
6Feb 14, 2025 00:1223,614219,160,985194,998,000999,0002,269,184
7Feb 14, 2025 00:1223,630223,216,358195,131,0001,000,0002,433,024
8Feb 14, 2025 00:1223,633215,038,021194,154,0002,001,0002,510,848
9Feb 14, 2025 00:1223,637224,194,293195,190,0001,000,0002,433,024