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 listAug 12, 2025 02:50Ashish AhujaAshish AhujaScore: 41,916Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 12, 2025 02:5041,885376,328,882345,648,0001,997,0002,510,848
2Aug 12, 2025 02:5041,889374,111,147345,684,0001,998,0002,506,752
3Aug 12, 2025 02:5041,890372,183,611346,687,000999,0002,285,568
4Aug 12, 2025 02:5041,909373,786,438345,845,0001,999,0002,510,848
5Aug 12, 2025 02:5041,916370,547,126346,901,000999,0002,277,376
6Aug 12, 2025 02:5041,928369,956,152346,000,0002,000,0002,277,376
7Aug 12, 2025 02:5041,982377,212,579346,456,0001,996,0002,277,376
8Aug 12, 2025 02:5041,990372,954,996346,517,0001,997,0002,277,376
9Aug 12, 2025 02:5042,048372,754,645346,996,0001,999,0002,510,848