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 17:17marko1597marko1597Score: 6,204Success
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 17:176,19361,554,58450,257,0001,149,0002,113,536
2Aug 14, 2026 17:176,19461,461,21450,233,0001,180,0002,113,536
3Aug 14, 2026 17:176,19861,489,27750,313,0001,138,0002,113,536
4Aug 14, 2026 17:176,20161,507,76550,321,0001,151,0002,113,536
5Aug 14, 2026 17:176,20461,591,04050,269,0001,226,0002,113,536
6Aug 14, 2026 17:176,21272,676,79650,370,0001,190,0002,113,536
7Aug 14, 2026 17:176,22561,727,85050,553,0001,119,0002,113,536
8Aug 14, 2026 17:176,26662,106,74050,764,0001,244,0002,113,536
9Aug 14, 2026 17:176,38463,826,91151,845,0001,147,0002,113,536