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 16, 2026 18:42KacpxerKacpxerScore: 6,139Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 16, 2026 18:436,09461,668,84649,570,0001,014,0002,113,536
2Oct 16, 2026 18:436,09961,102,74249,612,0001,014,0002,113,536
3Oct 16, 2026 18:436,10361,059,99449,383,0001,276,0002,113,536
4Oct 16, 2026 18:436,13772,227,43449,894,0001,045,0002,113,536
5Oct 16, 2026 18:436,13962,848,86449,942,0001,012,0002,113,536
6Oct 16, 2026 18:436,19373,227,70850,381,0001,027,0002,113,536
7Oct 16, 2026 18:436,21862,274,50450,582,0001,035,0002,113,536
8Oct 16, 2026 18:436,27673,214,57751,046,0001,051,0002,113,536
9Oct 16, 2026 18:437,29271,050,65759,513,0001,015,0002,113,536