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 8, 2025 19:04Leon ZhaoLeon ZhaoScore: 18,279Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 8, 2025 19:0418,275177,526,336150,687,000997,0002,285,568
2Aug 8, 2025 19:0418,277177,813,351148,703,0002,994,0002,285,568
3Aug 8, 2025 19:0418,277177,126,759149,707,0001,996,0002,285,568
4Aug 8, 2025 19:0418,279182,009,503151,716,00002,457,600
5Aug 8, 2025 19:0418,279176,585,581149,720,0001,996,0002,465,792
6Aug 8, 2025 19:0418,280178,779,069150,722,000998,0002,461,696
7Aug 8, 2025 19:0418,282176,815,211150,742,000998,0002,318,336
8Aug 8, 2025 19:0418,282178,596,113149,746,0001,996,0002,285,568
9Aug 8, 2025 19:0418,292182,095,247150,823,000998,0002,461,696