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 27, 2026 18:33Karthik ReddyKarthik ReddyScore: 5,105Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 27, 2026 18:354,98762,295,64040,383,0001,014,0002,113,536
2Sep 27, 2026 18:355,00359,900,95540,520,0001,013,0002,113,536
3Sep 27, 2026 18:355,00960,192,07240,564,0001,011,0002,113,536
4Sep 27, 2026 18:355,10352,632,45241,195,0001,164,0002,113,536
5Sep 27, 2026 18:355,10563,449,53641,196,0001,183,0002,113,536
6Sep 27, 2026 18:355,11062,243,03141,366,0001,049,0002,113,536
7Sep 27, 2026 18:355,15560,707,94441,737,0001,051,0002,113,536
8Sep 27, 2026 18:355,18661,601,05742,043,0001,009,0002,113,536
9Sep 27, 2026 18:355,38465,822,02742,628,0002,060,0002,113,536