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 listSep 12, 2024 12:34Dmitrii KravchenkoDmitrii KravchenkoScore: 47,745Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 12, 2024 12:3447,622431,996,128394,265,0001,000,0002,322,432
2Sep 12, 2024 12:3447,647426,388,474395,470,00002,318,336
3Sep 12, 2024 12:3447,696421,903,334393,880,0001,999,0002,281,472
4Sep 12, 2024 12:3447,698421,251,652393,895,0001,999,0002,281,472
5Sep 12, 2024 12:3447,745419,831,400395,283,0001,000,0002,281,472
6Sep 12, 2024 12:3447,748423,607,679396,306,00002,281,472
7Sep 12, 2024 12:3447,757417,920,211395,384,0001,000,0002,322,432
8Sep 12, 2024 12:3447,785424,127,039394,620,0001,998,0002,322,432
9Sep 12, 2024 12:3447,983421,030,269397,255,0001,000,0002,420,736