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 7, 2026 19:56neel-bhavsarneel-bhavsarScore: 70,741Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 7, 2026 19:5670,034591,370,467434,657,000146,633,00020,480
2Sep 7, 2026 19:5670,348593,976,442437,092,000146,803,00020,480
3Sep 7, 2026 19:5670,365594,203,710434,559,000149,475,00020,480
4Sep 7, 2026 19:5670,674596,733,320437,057,000149,540,0002,113,536
5Sep 7, 2026 19:5670,741598,759,197437,088,000150,067,00020,480
6Sep 7, 2026 19:5670,757597,205,080436,763,000150,523,00020,480
7Sep 7, 2026 19:5670,769597,329,010436,990,000150,396,0002,113,536
8Sep 7, 2026 19:5670,792598,300,788437,299,000150,275,00020,480
9Sep 7, 2026 19:5670,885598,353,113437,159,000151,191,00020,480