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 listJan 1, 2026 20:14Josu San MartinJosu San MartinScore: 6,496Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 1, 2026 20:146,15774,146,83848,097,0003,006,0002,506,752
2Jan 1, 2026 20:146,18980,024,47749,352,0002,014,0002,420,736
3Jan 1, 2026 20:146,27275,837,35050,057,0002,002,0002,330,624
4Jan 1, 2026 20:146,49681,632,25151,919,0001,996,0002,338,816
5Jan 1, 2026 20:146,51679,384,48352,081,0002,003,0002,277,376
6Jan 1, 2026 20:146,57181,263,52751,511,0003,030,0002,482,176