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 listJun 25, 2025 11:44Valentin KofmanValentin KofmanScore: 6,026Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 25, 2025 11:446,01570,352,28547,929,0001,997,0002,289,664
2Jun 25, 2025 11:446,01774,186,74047,942,0001,997,0002,277,376
3Jun 25, 2025 11:446,02073,041,62847,971,0001,998,0002,281,472
4Jun 25, 2025 11:446,02073,989,07347,965,0001,998,0002,277,376
5Jun 25, 2025 11:446,02474,727,28547,997,0001,999,0002,289,664
6Jun 25, 2025 11:446,02678,458,65548,019,0002,000,0002,289,664
7Jun 25, 2025 11:446,02673,221,01449,014,0001,000,0002,269,184
8Jun 25, 2025 11:446,03572,592,37548,091,0002,003,0002,289,664
9Jun 25, 2025 11:446,05175,419,56849,217,0001,004,0002,273,280
10Jun 25, 2025 11:446,10277,056,03950,647,00002,289,664
11Jun 25, 2025 11:446,11776,707,45348,780,0001,991,0002,273,280
12Jun 25, 2025 11:446,12079,504,91349,802,000996,0002,273,280