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 30, 2026 19:32Karthik ReddyKarthik ReddyScore: 58,699Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 30, 2026 19:3258,678495,916,484428,836,00058,197,0002,113,536
2Sep 30, 2026 19:3258,678495,914,503428,833,00058,198,0002,113,536
3Sep 30, 2026 19:3258,680496,254,560428,834,00058,214,0002,113,536
4Sep 30, 2026 19:3258,686496,124,126428,897,00058,201,0002,113,536
5Sep 30, 2026 19:3258,699496,132,552428,097,00059,112,0002,113,536
6Sep 30, 2026 19:3258,703496,170,828428,092,00059,143,0002,113,536
7Sep 30, 2026 19:3258,718496,323,276428,233,00059,133,0002,113,536
8Sep 30, 2026 19:3258,726496,409,595429,197,00058,229,0002,113,536
9Sep 30, 2026 19:3258,783496,871,164428,705,00059,195,0002,113,536