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 08:00Weitao WanWeitao WanScore: 39,098Success
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 08:0039,071352,369,996324,291,00002,289,664
2Oct 27, 2025 08:0039,071350,376,812323,290,0001,000,0002,289,664
3Oct 27, 2025 08:0039,074348,430,183323,314,0001,000,0002,514,944
4Oct 27, 2025 08:0039,097353,773,820323,503,0001,001,0002,265,088
5Oct 27, 2025 08:0039,098352,023,746323,516,0001,001,0002,289,664
6Oct 27, 2025 08:0039,101354,778,739323,540,000998,0002,289,664
7Oct 27, 2025 08:0039,118351,425,894323,678,000999,0002,273,280
8Oct 27, 2025 08:0039,367355,682,970324,749,0001,998,0002,514,944
9Oct 27, 2025 08:0039,834358,760,716328,626,0001,997,0002,273,280