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 28, 2025 16:19Valentin KofmanValentin KofmanScore: 6,002Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jun 28, 2025 16:195,97077,804,27148,543,0001,011,0002,273,280
2Jun 28, 2025 16:195,97479,814,34448,570,0001,011,0002,289,664
3Jun 28, 2025 16:195,98182,973,43149,642,00002,289,664
4Jun 28, 2025 16:195,98277,871,55948,634,0001,013,0002,277,376
5Jun 28, 2025 16:195,98577,732,10649,676,00002,289,664
6Jun 28, 2025 16:196,00175,109,22347,815,0001,992,0002,289,664
7Jun 28, 2025 16:196,00277,195,29648,817,000996,0002,371,584
8Jun 28, 2025 16:196,00275,576,71848,824,000996,0002,289,664
9Jun 28, 2025 16:196,02774,689,80348,023,0002,000,0002,289,664
10Jun 28, 2025 16:197,86788,652,66864,288,0001,004,0002,289,664
11Jun 28, 2025 16:197,86984,747,02063,302,0002,009,0002,289,664
12Jun 28, 2025 16:197,90694,431,50064,609,0001,009,0002,289,664