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 16, 2026 17:46marko1597marko1597Score: 6,360Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 16, 2026 17:505,14651,851,37141,533,0001,184,0002,117,632
2Aug 16, 2026 17:505,14751,887,71141,546,0001,176,0002,117,632
3Aug 16, 2026 17:505,14951,161,45841,573,0001,164,0002,117,632
4Aug 16, 2026 17:505,23252,549,30242,262,0001,168,0002,117,632
5Aug 16, 2026 17:506,36061,937,72551,608,0001,182,0002,117,632
6Aug 16, 2026 17:506,81465,849,89855,384,0001,179,0002,117,632
7Aug 16, 2026 17:506,85465,773,41155,715,0001,176,0002,117,632
8Aug 16, 2026 17:506,98167,042,97756,770,0001,179,0002,117,632
9Aug 16, 2026 17:507,10067,458,31557,755,0001,179,0002,117,632