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 20, 2026 21:49Kevin HeaveyKevin HeaveyScore: 8,586Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 20, 2026 21:498,17178,250,28065,161,0002,666,0002,117,632
2Jul 20, 2026 21:498,23878,082,52865,786,0002,596,0002,117,632
3Jul 20, 2026 21:498,32679,511,61666,490,0002,624,0002,117,632
4Jul 20, 2026 21:498,41479,639,57667,239,0002,599,0002,117,632
5Jul 20, 2026 21:498,58681,670,09668,619,0002,648,0002,117,632
6Jul 20, 2026 21:498,64481,469,58869,137,0002,609,0002,117,632
7Jul 20, 2026 21:4920,092176,464,675164,305,0002,463,0002,117,632
8Jul 20, 2026 21:4920,221178,165,241165,179,0002,662,0002,117,632
9Jul 20, 2026 21:4920,697181,568,103169,214,0002,579,0002,117,632