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 18, 2025 06:05Ashish AhujaAshish AhujaScore: 11,583Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Aug 18, 2025 06:0511,425123,144,10085,841,0008,983,0002,285,568
2Aug 18, 2025 06:0511,433125,275,74283,910,00010,988,0002,293,760
3Aug 18, 2025 06:0511,461116,323,87888,114,0007,009,0002,338,816
4Aug 18, 2025 06:0511,514119,869,81886,608,0008,959,0002,260,992
5Aug 18, 2025 06:0511,551119,006,15387,882,0007,989,0002,527,232
6Aug 18, 2025 06:0511,567118,052,48087,002,0009,000,0002,347,008
7Aug 18, 2025 06:0511,583115,933,27688,130,0008,011,0002,523,136
8Aug 18, 2025 06:0511,753123,047,40588,592,0008,958,0002,531,328
9Aug 18, 2025 06:0511,867123,504,71588,550,0009,949,0002,523,136
10Aug 18, 2025 06:0511,993129,740,85391,575,0007,963,0002,351,104
11Aug 18, 2025 06:0512,097124,104,53092,374,0008,032,0002,277,376
12Aug 18, 2025 06:0512,373124,211,87795,713,0006,979,0002,347,008