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 listMar 2, 2025 21:09Aniruddha DebAniruddha DebScore: 9,308Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 2, 2025 21:099,251100,225,47671,800,0004,986,0002,400,256
2Mar 2, 2025 21:149,28099,226,58574,022,0003,000,0002,424,832
3Mar 2, 2025 21:149,29099,377,96575,101,0002,002,0002,416,640
4Mar 2, 2025 21:099,30897,900,77675,252,0002,006,0002,412,544
5Mar 2, 2025 21:099,349108,932,21773,564,0004,030,0002,273,280
6Mar 2, 2025 21:149,385106,215,22273,903,0003,994,0002,428,928