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 listOct 2, 2026 07:50Karthik ReddyKarthik ReddyScore: 3,396Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 2, 2026 07:503,38237,089,40628,078,000020,480
2Oct 2, 2026 07:503,38937,112,21828,129,000020,480
3Oct 2, 2026 07:503,39038,562,12228,140,000020,480
4Oct 2, 2026 07:503,39437,150,50428,173,000020,480
5Oct 2, 2026 07:503,39637,187,17028,192,000020,480
6Oct 2, 2026 07:503,39837,195,84128,208,000020,480
7Oct 2, 2026 07:503,40337,151,35728,251,000020,480
8Oct 2, 2026 07:503,41637,360,83927,340,0001,017,00020,480
9Oct 2, 2026 07:503,41937,421,41128,381,000020,480