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 14:07Valentin KofmanValentin KofmanScore: 6,007Success
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 14:076,00178,145,67047,818,0001,992,0002,289,664
2Jun 28, 2025 14:076,00175,149,04147,819,0001,992,0002,281,472
3Jun 28, 2025 14:076,00274,426,95148,821,000996,0002,273,280
4Jun 28, 2025 14:076,00282,731,98748,824,000996,0002,289,664
5Jun 28, 2025 14:076,00378,880,95148,827,000996,0002,289,664
6Jun 28, 2025 14:076,00473,948,98747,843,0001,993,0002,289,664
7Jun 28, 2025 14:076,00773,886,49048,859,000997,0002,289,664
8Jun 28, 2025 14:076,00773,948,61847,868,0001,994,0002,375,680
9Jun 28, 2025 14:076,00874,420,06948,868,000997,0002,281,472
10Jun 28, 2025 14:077,87993,143,10964,392,0001,006,0002,289,664
11Jun 28, 2025 14:077,926101,839,59863,794,0001,993,0002,273,280
12Jun 28, 2025 14:077,930100,110,16463,824,0001,994,0002,289,664