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 listOct 25, 2025 22:03CheranMahalingamCheranMahalingamScore: 74,363Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 25, 2025 22:0574,287644,080,052615,581,000999,0002,285,568
2Oct 25, 2025 22:0574,350639,819,971615,104,0002,000,0002,269,184
3Oct 25, 2025 22:0374,352638,394,195616,120,0001,000,0002,277,376
4Oct 25, 2025 22:0374,363640,933,370616,209,0001,000,0002,285,568
5Oct 25, 2025 22:0574,367648,166,601617,245,00002,285,568
6Oct 25, 2025 22:0374,371647,353,776616,282,0001,000,0002,523,136