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 listDec 28, 2024 13:00NeoNeoScore: 49,210Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Dec 28, 2024 13:0049,163435,028,116406,052,0002,000,0002,289,664
2Dec 28, 2024 13:0049,170436,876,957408,115,00002,269,184
3Dec 28, 2024 13:0049,189434,663,355407,265,0001,000,0002,289,664
4Dec 28, 2024 13:0049,192435,397,858407,293,000998,0002,285,568
5Dec 28, 2024 13:0049,210435,156,518408,440,00002,289,664
6Dec 28, 2024 13:0050,465448,945,018417,863,000999,0002,285,568
7Dec 28, 2024 13:0050,486441,678,688418,037,0001,000,0002,285,568
8Dec 28, 2024 13:0050,488439,989,603417,047,0002,000,0002,355,200
9Dec 28, 2024 13:0051,064446,530,274422,832,000999,0002,269,184