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 listJan 11, 2025 16:58Advait IyerAdvait IyerScore: 82,113Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 11, 2025 16:5882,084709,937,795681,300,00002,277,376
2Jan 11, 2025 16:5882,101707,851,582679,443,0001,998,0002,523,136
3Jan 11, 2025 16:5882,112708,510,923679,529,0001,998,0002,277,376
4Jan 11, 2025 16:5882,112708,922,123679,534,0001,998,0002,277,376
5Jan 11, 2025 16:5882,113708,163,877678,538,0002,997,0002,523,136
6Jan 11, 2025 16:5882,121708,637,966679,609,0001,998,0002,265,088
7Jan 11, 2025 16:5882,174706,413,282681,046,0001,000,0002,265,088
8Jan 11, 2025 16:5882,176706,593,499681,060,0001,000,0002,277,376
9Jan 11, 2025 16:5882,251712,520,600679,685,0002,998,0002,277,376