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 19, 2025 23:49Advait IyerAdvait IyerScore: 52,000Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Oct 19, 2025 23:4951,973459,888,080431,372,00002,273,280
2Oct 19, 2025 23:4951,974461,273,856430,384,0001,000,0002,277,376
3Oct 19, 2025 23:4951,975456,133,784431,392,00002,289,664
4Oct 19, 2025 23:4951,998457,833,115429,584,0001,998,0002,289,664
5Oct 19, 2025 23:4952,000464,338,128429,599,0001,998,0002,289,664
6Oct 19, 2025 23:4952,000462,162,963429,605,0001,998,0002,269,184
7Oct 19, 2025 23:4952,004464,524,843429,639,0001,998,0002,285,568
8Oct 19, 2025 23:4952,006457,293,343429,652,0001,998,0002,289,664
9Oct 19, 2025 23:4952,032460,277,188430,864,000999,0002,289,664