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 listAug 14, 2026 19:44marko1597marko1597Score: 86,576Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2026 20:1285,524719,833,523708,637,0001,219,0002,117,632stderr
2Aug 14, 2026 20:1285,855723,365,815711,591,0001,006,0002,117,632stderr
3Aug 14, 2026 20:1286,042724,298,099713,122,0001,031,0002,117,632stderr
4Aug 14, 2026 20:1286,074724,946,010713,177,0001,239,0002,117,632stderr
5Aug 14, 2026 20:1286,576728,717,796717,581,0001,003,0002,117,632stderr
6Aug 14, 2026 20:1286,630729,828,538717,761,0001,274,0002,117,632stderr
7Aug 14, 2026 20:1286,703730,460,459718,416,0001,226,0002,117,632stderr
8Aug 14, 2026 20:1286,769730,965,976719,184,0001,003,0002,117,632stderr
9Aug 14, 2026 20:1286,937732,487,963719,391,0002,192,0002,117,632stderr