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 listAug 14, 2025 00:04Andrija ZarićAndrija ZarićScore: 56,416Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 14, 2025 00:0456,386502,553,117466,005,0002,000,0002,289,664
2Aug 14, 2025 00:0456,396490,980,478468,086,00002,289,664
3Aug 14, 2025 00:0456,405490,993,618467,158,0001,000,0002,285,568
4Aug 14, 2025 00:0456,405494,365,976467,162,0001,000,0002,469,888
5Aug 14, 2025 00:0456,416494,922,358467,256,0001,000,0002,289,664
6Aug 14, 2025 00:0456,429495,528,363468,361,00002,355,200
7Aug 14, 2025 00:0456,430493,149,613467,367,0001,000,0002,371,584
8Aug 14, 2025 00:0456,458493,488,254466,604,0001,998,0002,285,568
9Aug 14, 2025 00:0456,459491,798,262467,610,000999,0002,293,760