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 listFeb 24, 2026 22:13Mikołaj UzarskiMikołaj UzarskiScore: 5,521Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 24, 2026 22:135,48968,358,32344,546,0001,012,0002,277,376
2Feb 24, 2026 22:135,49677,463,50644,602,0001,013,0002,281,472
3Feb 24, 2026 22:135,49777,336,20544,613,0001,013,0002,277,376
4Feb 24, 2026 22:135,50172,582,45044,644,0001,014,0002,351,104
5Feb 24, 2026 22:135,52176,511,26743,833,0001,992,0002,494,464
6Feb 24, 2026 22:135,54571,229,75445,020,0001,000,0002,285,568
7Feb 24, 2026 22:135,56169,388,38244,152,0002,006,0002,351,104
8Feb 24, 2026 22:135,57874,749,41645,288,0001,006,0002,285,568
9Feb 24, 2026 22:135,64373,187,63444,844,0001,993,0002,285,568