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 listFeb 12, 2025 21:39Miguel Rodrigues Carrilho BorgesMiguel Rodrigues Carrilho BorgesScore: 62,236Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Feb 12, 2025 21:3962,031536,457,925512,861,0001,999,0002,269,184
2Feb 12, 2025 21:3962,032538,021,528512,864,0001,999,0002,265,088
3Feb 12, 2025 21:3962,085542,221,445514,302,0001,000,0002,289,664
4Feb 12, 2025 21:3962,207545,537,257516,314,00002,281,472
5Feb 12, 2025 21:3962,236550,660,815514,560,0001,998,0002,269,184
6Feb 12, 2025 21:3962,245541,205,041514,634,0001,998,0002,289,664
7Feb 12, 2025 21:3962,245543,735,402514,634,0001,998,0002,265,088
8Feb 12, 2025 21:3962,248538,783,401514,664,0001,998,0002,281,472
9Feb 12, 2025 21:3962,276539,275,968513,894,0002,999,0002,289,664