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 listDec 25, 2024 15:43Aniruddha DebAniruddha DebScore: 54,246Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 25, 2024 15:4354,226478,204,416448,077,0002,000,0002,269,184
2Dec 25, 2024 15:4354,239469,484,989448,183,0002,000,0002,265,088
3Dec 25, 2024 15:4354,243473,577,587448,217,0002,000,0002,277,376
4Dec 25, 2024 15:4354,245475,377,375449,235,0001,000,0002,285,568
5Dec 25, 2024 15:4354,246476,389,310449,240,0001,000,0002,269,184
6Dec 25, 2024 15:4354,249471,570,483448,264,0002,001,0002,269,184
7Dec 25, 2024 15:4354,254474,905,477449,312,0001,000,0002,285,568
8Dec 25, 2024 15:4354,258475,980,280449,339,0001,000,0002,285,568
9Dec 25, 2024 15:4354,260472,984,598449,357,0001,000,0002,277,376