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 listAug 8, 2025 20:33Leon ZhaoLeon ZhaoScore: 17,721Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 20:3317,690176,364,125145,830,000998,0002,469,888
2Aug 8, 2025 20:3317,715180,623,102146,038,0001,000,0002,285,568
3Aug 8, 2025 20:3317,717175,677,461145,052,0002,000,0002,473,984
4Aug 8, 2025 20:3317,719172,906,138145,065,0002,000,0002,461,696
5Aug 8, 2025 20:3317,721173,183,220145,087,0002,001,0002,285,568
6Aug 8, 2025 20:3317,731173,708,309146,170,0001,001,0002,457,600
7Aug 8, 2025 20:3317,732173,142,072145,172,0002,002,0002,285,568
8Aug 8, 2025 20:3317,738176,324,431145,225,0002,003,0002,285,568
9Aug 8, 2025 20:3317,744177,693,846145,269,0002,003,0002,478,080