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 29, 2026 07:15Karthik ReddyKarthik ReddyScore: 5,675Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 29, 2026 07:165,65857,312,54845,858,0001,106,0002,113,536
2Sep 29, 2026 07:165,66357,744,79045,913,0001,093,0002,113,536
3Sep 29, 2026 07:165,66857,461,97945,935,0001,115,0002,113,536
4Sep 29, 2026 07:165,67457,760,61345,996,0001,102,0002,113,536
5Sep 29, 2026 07:165,67557,422,27245,991,0001,118,0002,113,536
6Sep 29, 2026 07:165,68058,880,07346,100,0001,047,0002,113,536
7Sep 29, 2026 07:165,68857,514,75446,100,0001,113,0002,113,536
8Sep 29, 2026 07:165,69657,617,18846,164,0001,114,0002,113,536
9Sep 29, 2026 07:165,69757,570,41846,271,0001,022,0002,113,536