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 listApr 2, 2025 17:47ndrenndrenScore: 68,051Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 2, 2025 17:4768,033594,849,667563,674,000999,0002,383,872
2Apr 2, 2025 17:4768,037589,368,810562,708,0001,998,0002,260,992
3Apr 2, 2025 17:4768,038593,360,783562,714,0001,998,0002,387,968
4Apr 2, 2025 17:4768,043589,529,871562,762,0001,999,0002,383,872
5Apr 2, 2025 17:4768,051590,739,400563,824,000999,0002,260,992
6Apr 2, 2025 17:4768,068594,580,856562,962,0001,999,0002,396,160
7Apr 2, 2025 17:4768,085592,195,497564,109,0001,000,0002,265,088
8Apr 2, 2025 17:4768,146596,401,309564,614,000999,0002,375,680
9Apr 2, 2025 17:4768,196596,980,871564,029,0002,000,0002,383,872