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 07:04Karthik ReddyKarthik ReddyScore: 5,020Success
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 07:044,86150,638,39639,215,0001,133,0002,113,536
2Sep 27, 2026 07:044,86551,965,44039,260,0001,123,0002,113,536
3Sep 27, 2026 07:044,86950,708,85239,282,0001,133,0002,113,536
4Sep 27, 2026 07:045,00851,841,94240,421,0001,146,0002,113,536
5Sep 27, 2026 07:045,02053,826,76840,518,0001,152,0002,113,536
6Sep 27, 2026 07:045,02351,967,61940,544,0001,150,0002,113,536
7Sep 27, 2026 07:045,02752,049,29340,581,0001,145,0002,113,536
8Sep 27, 2026 07:045,02951,984,72540,585,0001,160,0002,113,536
9Sep 27, 2026 07:045,04352,183,58240,795,0001,063,0002,113,536