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 listOct 27, 2025 16:54Weitao WanWeitao WanScore: 33,631Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 27, 2025 16:5433,612308,975,697276,981,0001,999,0002,260,992
2Oct 27, 2025 16:5433,616301,680,472278,009,0001,000,0002,285,568
3Oct 27, 2025 16:5433,620302,766,762278,043,0001,000,0002,285,568
4Oct 27, 2025 16:5433,626306,369,678278,092,0001,000,0002,285,568
5Oct 27, 2025 16:5433,631306,681,627277,137,0002,000,0002,285,568
6Oct 27, 2025 16:5433,631301,529,965278,135,0001,000,0002,285,568
7Oct 27, 2025 16:5433,636303,553,620278,177,0001,000,0002,277,376
8Oct 27, 2025 16:5433,644303,182,408278,248,0001,000,0002,260,992
9Oct 27, 2025 16:5433,649302,594,133277,285,0002,002,0002,285,568