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 listJul 22, 2026 12:17Kevin HeaveyKevin HeaveyScore: 4,657Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 22, 2026 12:244,58453,126,15235,772,0002,283,0002,121,728
2Jul 22, 2026 12:244,59348,084,53335,035,0003,087,0002,121,728
3Jul 22, 2026 12:244,60748,122,28236,147,0002,092,0002,121,728
4Jul 22, 2026 12:244,61953,619,97735,240,0003,103,0002,121,728
5Jul 22, 2026 12:244,65757,127,84235,581,0003,075,0002,125,824
6Jul 22, 2026 12:244,66048,590,75235,590,0003,089,0002,121,728
7Jul 22, 2026 12:244,66848,697,29235,610,0003,140,0002,121,728
8Jul 22, 2026 12:244,75649,344,32237,378,0002,098,0002,121,728
9Jul 22, 2026 12:245,07351,978,02839,015,0003,094,0002,121,728