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 27, 2025 09:26Tan Lip WeiTan Lip WeiScore: 30,819Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 09:2630,788283,609,347255,544,00002,285,568
2Oct 27, 2025 09:2630,804283,085,615253,675,0001,997,0002,285,568
3Oct 27, 2025 09:2630,809278,870,992254,720,000998,0002,285,568
4Oct 27, 2025 09:2630,810282,516,334253,727,0001,997,0002,285,568
5Oct 27, 2025 09:2630,819279,707,642253,799,0001,998,0002,285,568
6Oct 27, 2025 09:2630,831282,594,938253,898,0001,999,0002,277,376
7Oct 27, 2025 09:2630,836277,848,402254,941,000999,0002,519,040
8Oct 27, 2025 09:2630,842277,968,236253,991,0001,999,0002,519,040
9Oct 27, 2025 09:2630,861278,778,120254,149,0002,001,0002,519,040